On the Crossing Number of Kn without Computer Assistance
From MaRDI portal
Publication:3188671
DOI10.1002/jgt.21908zbMath1342.05091MaRDI 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
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Bishellable drawings of $K_n$, On Numerical Invariant of Graph, Convex drawings of the complete graph: topology meets geometry, Closing in on Hill's Conjecture, Drawings of complete graphs in the projective plane, On the crossing number of \(K_{13}\)
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 K11 is 100