OpenAI reports the Harary–Hill crossing-number formula
- Mathematics
For every n≥3, the ordinary crossing number of Kₙ equals ¼⌊n/2⌋⌊(n−1)/2⌋⌊(n−2)/2⌋⌊(n−3)/2⌋.
For every n≥3, the ordinary crossing number of Kₙ equals ¼⌊n/2⌋⌊(n−1)/2⌋⌊(n−2)/2⌋⌊(n−3)/2⌋.
For every n≥3, the ordinary crossing number of Kₙ equals ¼⌊n/2⌋⌊(n−1)/2⌋⌊(n−2)/2⌋⌊(n−3)/2⌋.
For every n≥3, the ordinary crossing number of Kₙ equals ¼⌊n/2⌋⌊(n−1)/2⌋⌊(n−2)/2⌋⌊(n−3)/2⌋.
If correct, resolves the Harary–Hill conjecture for complete graphs of every order.
Does every complete graph have the Harary–Hill crossing number?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.