Barnette's conjecture: a round trip over every polyhedron (3D)

About this app

A polyhedron with three edges at every vertex and only even faces always has a round trip that visits every vertex exactly once. A glowing thread searches for it live by backtracking: on the cube, a prism, Archimedean solids and random polyhedra with faces up to twelve vertices and more. Vertices in two colours, large faces tinted. Two counterexamples, each missing one condition (Tutte graph, three chambers), make the complete search fail. openai/math family 180 (formalised in Lean). Exhibit-ready.

Subject: Open problems, solved by AI

More from Open problems, solved by AI

• Anderson localisation: 2D vs. 3D (3D)
• Barker sequences and circulant Hadamard matrices
• Birkhoff billiards: only the ellipse has no gaps
• Cardy's formula — percolation in a random tiling
• The plane is not five-colourable (Hadwiger–Nelson)
• Double-dimer loops and CLE₄
• Triangular billiards — irrational angles mix (3D)
• Triangular lattice — universal optimality

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps