Paperlane

no. 1 · Friday 23 October 2026

A note on the proof of Barnette's conjecture

Zhentao Li

math.CO · 14 pp

Abstract

Barnette's conjecture states that every cubic 3-connected bipartite planar graph has a Hamiltonian cycle. We present a digested exposition of OpenAI's generated proof of Barnette's conjecture \cite{openai-barnette}.

comments
14 pages, 3 figures
fields
Combinatorics
pdf ↗ page arXiv:2610.30490 ↗