The early history of the brick factory problem

DOI10.1007/S00283-009-9120-4MaRDI QIDQ2431395zbMATH OpenOpenAlexWikidataFDO

Authors L. W. Beineke, Robin Wilson

Publication date 13 April 2011

Published in The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00283-009-9120-4

Mathematics Subject Classification ID

History of combinatorics (05-03) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of mathematical programming (90C90)

Cites work

• Bounds for rectilinear crossing numbers
• Computing crossing numbers in quadratic time
• Crossing Number is NP-Complete
• Crossing numbers
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• scientific article; zbMATH DE number 3446923 (Why is no real title available?)
• scientific article; zbMATH DE number 3084814 (Why is no real title available?)
• On a problem of P. Turan concerning graphs
• On the Number of Crossings in a Complete Graph
• The crossing number of K₁₁ is 100
• The Crossing Number of C_m × C_n: A Reluctant Induction
• The crossing number of K5,n
• The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)
• The rectilinear crossing number of \(K_{10}\) is 62

Cited in

(21)

• The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
• Approximating the bundled crossing number
• On the crossing number of 2-page book drawings of K_n with prescribed number of edges in each page
• The 2-page crossing number of \(K_{n}\)
• Sketchy tweets: ten minute conjectures in graph theory
• Asymptotically settling Zarankiewicz's conjecture in finite time, for each m
• On crossing numbers of complete tripartite and balanced complete multipartite graphs
• On the crossing number of K_n without computer assistance
• Bishellable drawings of K_n
• Working with Lowell
• Convex drawings of the complete graph: topology meets geometry
• A survey of graphs with known or bounded crossing numbers
• Closing in on Hill's conjecture
• Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
• Reviews
• Bounding the tripartite‐circle crossing number of complete tripartite graphs
• Approximating the Bundled Crossing Number
• The crossing number of Cartesian product of sunlet graph with path and complete bipartite graph
• Bounding the tripartite-circle crossing number of complete tripartite graphs
• On the uncrossed number of graphs
• Associahedra minimize f-vectors of secondary polytopes of planar point sets

This page was built for publication: The early history of the brick factory problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431395)