On the Crossing Number of Kn without Computer Assistance

DOI10.1002/jgt.21908zbMath1342.05091OpenAlexW1952256967MaRDI QIDQ3188671

R. Bruce Richter, Daniel McQuillan

Publication date: 12 August 2016

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

Full work available at URL: https://doi.org/10.1002/jgt.21908

zbMATH Keywords

crossing numbercomplete graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Bishellable drawings of $K_n$ ⋮ Convex drawings of the complete graph: topology meets geometry ⋮ Drawings of complete graphs in the projective plane ⋮ On the crossing number of \(K_{13}\) ⋮ Closing in on Hill's Conjecture ⋮ On Numerical Invariant of Graph

Cites Work

• On the crossing number of \(K_{13}\)
• A note on the parity of the number of crossings of a graph
• Zarankiewicz's conjecture is finite for each fixed \(m\)
• The early history of the brick factory problem
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• The crossing number of K₁₁ is 100

This page was built for publication: On the Crossing Number of Kn without Computer Assistance