The early history of the brick factory problem

DOI10.1007/s00283-009-9120-4zbMath1226.05093OpenAlexW2092138019WikidataQ59446749 ScholiaQ59446749MaRDI QIDQ2431395

Robin J. Wilson, Lowell W. Beineke

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

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

Related Items (17)

The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph ⋮ Bishellable drawings of $K_n$ ⋮ Approximating the bundled crossing number ⋮ On the Crossing Number of Kn without Computer Assistance ⋮ The 2-page crossing number of \(K_{n}\) ⋮ Convex drawings of the complete graph: topology meets geometry ⋮ Reviews ⋮ Bounding the tripartite‐circle crossing number of complete tripartite graphs ⋮ Approximating the Bundled Crossing Number ⋮ Sketchy tweets: ten minute conjectures in graph theory ⋮ On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs ⋮ Unnamed Item ⋮ A survey of graphs with known or bounded crossing numbers ⋮ On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page ⋮ Closing in on Hill's Conjecture ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ Working with Lowell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing crossing numbers in quadratic time
• The Crossing Number of C_m × C_n: A Reluctant Induction
• [https://portal.mardi4nfdi.de/wiki/Publication:3156923 The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)]
• Crossing Number is NP-Complete
• Bounds for rectilinear crossing numbers
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• The crossing number of K₁₁ is 100
• The crossing number of K5,n
• On the Number of Crossings in a Complete Graph
• On a problem of P. Turan concerning graphs
• The rectilinear crossing number of \(K_{10}\) is 62

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