Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill

DOI10.1007/978-3-319-31940-7_13zbMath1352.05060OpenAlexW2539357570MaRDI QIDQ5506784

László A. Székely

Publication date: 16 December 2016

Published in: Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_13

zbMATH Keywords

graph drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Inducibility in Binary Trees and Crossings in Random Tanglegrams ⋮ Universal quivers ⋮ Closing in on Hill's Conjecture ⋮ On Numerical Invariant of Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the crossing number of complete graphs
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• On \(k\)-planar crossing numbers
• An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\)
• Biplanar graphs: A survey
• On the crossing number of \(K_{m,n}\)
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Drawings of graphs on surfaces with few crossings
• Zarankiewicz's conjecture is finite for each fixed \(m\)
• The graph crossing number and its variants: a survey
• New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
• The 2-page crossing number of \(K_{n}\)
• The early history of the brick factory problem
• Book drawings of complete bipartite graphs
• Shellable drawings and the cylindrical crossing number of \(K_n\)
• A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
• A lower bound for the rectilinear crossing number
• The crossing number of \(K_{4,n}\) on the real projective plane
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Crossing Number is NP-Complete
• The Minor Crossing Number
• New upper bounds for the crossing number of $K_n$ on the Klein bottle
• On stable crossing numbers
• Bounds for rectilinear crossing numbers
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• On the Distribution of Crossings in Random Complete Graphs
• The crossing number of K₁₁ is 100
• Flag algebras
• Improved Bounds for the Crossing Numbers of Km,n and Kn
• The toroidal crossing number of the complete graph
• The toroidal crossing number of Km,n
• On a problem of P. Erdös
• The crossing number of K5,n
• On a problem of P. Turan concerning graphs

This page was built for publication: Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill