Closing in on Hill's Conjecture

DOI10.1137/17M1158859zbMath1419.05050arXiv1711.08958WikidataQ123149958 ScholiaQ123149958MaRDI QIDQ5232152

Bernard Lidický, József Balogh, Gelasio Salazar

Publication date: 29 August 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.08958

zbMATH Keywords

crossing numbercomplete graphflag algebrasHill's conjecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Maximum number of almost similar triangles in the plane ⋮ Convex drawings of the complete graph: topology meets geometry ⋮ From art and circuit design to geometry and combinatorics ⋮ On the problems of CF-connected graphs ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ A survey of graphs with known or bounded crossing numbers ⋮ On Numerical Invariant of Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved enumeration of simple topological graphs
• A new lower bound based on Gromov's method of selecting heavily covered points
• On the crossing number of \(K_{13}\)
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• On the number of pentagons in triangle-free graphs
• Zarankiewicz's conjecture is finite for each fixed \(m\)
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• The 2-page crossing number of \(K_{n}\)
• Rainbow triangles in three-colored graphs
• The early history of the brick factory problem
• Shellable drawings and the cylindrical crossing number of \(K_n\)
• Simple Realizability of Complete Abstract Topological Graphs Simplified
• On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
• A Parity Theorem for Drawings of Complete and Complete Bipartite Graphs
• Hypergraphs Do Jump
• On the Crossing Number of Kn without Computer Assistance
• On the Minimal Density of Triangles in Graphs
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves. Gioan's Theorem
• Levi's Lemma, pseudolinear drawings of , and empty triangles
• Convex drawings of the complete graph: topology meets geometry
• On the Distribution of Crossings in Random Complete Graphs
• Limits of Order Types
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• The crossing number of K₁₁ is 100
• Flag algebras
• Improved Bounds for the Crossing Numbers of Km,n and Kn
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill
• The crossing number of K5,n
• On the Number of Crossings in a Complete Graph
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Closing in on Hill's Conjecture