On the crossing number of K₁₃
From MaRDI portal
Publication:490997
Abstract: Since the crossing number of K_{12} is now known to be 150, it is well-known that simple counting arguments and Kleitman's parity theorem for the crossing number of K_{2n+1} combine with a specific drawing of K_{13} to show that the crossing number of K_{13} is one of the numbers in {217,219,221,223,225}. We show that the crossing number is not 217.
Recommendations
Cites work
- scientific article; zbMATH DE number 3344600 (Why is no real title available?)
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- On the crossing number of \(K_n\) without computer assistance
- The crossing number of K11 is 100
- The crossing number of K5,n
- Zarankiewicz's conjecture is finite for each fixed \(m\)
Cited in
(12)- A contribution to Guy's conjecture
- On the crossing number of \(K_n\) without computer assistance
- On Numerical Invariant of Graph
- On the parity of crossing numbers
- On the crossing number of the Cartesian product of a sunlet graph and a star graph
- Rotation and crossing numbers for join products
- Closing in on Hill's conjecture
- On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars
- A note on the cross-index of a complete graph based on a linear tree
- A survey of graphs with known or bounded crossing numbers
- The crossing number of K11 is 100
- Convex drawings of the complete graph: topology meets geometry
This page was built for publication: On the crossing number of \(K_{13}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490997)