The early history of the brick factory problem

DOI10.1007/S00283-009-9120-4zbMATH Open1226.05093OpenAlexW2092138019WikidataQ59446749 ScholiaQ59446749MaRDI QIDQ2431395FDOQ2431395

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

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

Cites Work

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

Cited In (19)

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

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)