How to Use
Select graph:
- cr: Crossing number
- Planar: cr=0?
- Conjecture: Bounds
Guy's Conjecture
cr(K_n) = Z(n) = ⌊n/2⌋⌊(n-1)/2⌋⌊(n-2)/2⌋⌊(n-3)/2⌋/4. Verified for n≤12. Z(5)=1, Z(6)=3, Z(7)=9, Z(8)=18, Z(9)=36. Related to the VLSI chip layout problem.
Applications
VLSI chip design: minimize wire crossings. Graph visualization: cleaner diagrams. Network layout: reduce interference. The crossing lemma: cr(G) ≥ |E|³/(33.75|V|²) for |E|≥4|V|.
Step-by-Step Instructions
- 1Select graph.
- 2Compute cr(G).
- 3Check planarity.
- 4Apply bounds.
- 5Compare drawings.