1 · The essentials
Imagine a finite network of points joined by links. The question is whether you can follow a closed route that visits every point exactly once before returning to the start. Barnette’s conjecture says that such a route exists for every network satisfying a particular set of conditions. Each point must have exactly three links, no link may join a point to itself, and no two points may have more than one link between them. The points must split into two groups with every link running between the groups, and the network must be drawable in the plane without links crossing. It must also remain connected when any one or two points are removed. The supplied manuscript claims this statement, and the main result has a Lean formalization, although the supplied material does not specify its detailed scope.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, think of planning a walk through a collection of junctions, visiting every junction once and ending where you began. The result concerns networks with very specific connection rules; it is not a promise that every street map permits such a walk.
Why it matters
The statement gives a universal guarantee: every graph meeting all the listed conditions has the required cycle. The repository describes this as resolving Barnette’s conjecture. Its summary also gives a related formulation in which a cycle must contain a specified three-edge path.
2 · Going further
The precise main statement is that every finite simple cubic bipartite planar -vertex-connected graph has a Hamiltonian cycle. Here, cubic means that every vertex has degree three; bipartite means that vertices can be partitioned into two sets with edges only between the sets. Planarity requires a drawing without edge crossings, while -vertex-connectivity requires connectivity to survive the deletion of any one or two vertices. A Hamiltonian cycle passes through every vertex exactly once before closing.
The source identifies this statement as Barnette’s conjecture, and the repository summary describes it as resolved. It also states an equivalent formulation: every three-edge path in a finite simple cubic -vertex-connected bipartite Pfaffian graph lies in a Hamiltonian cycle. This formulation asks for a cycle containing a prescribed path, under the hypotheses stated there; the supplied text does not explain the equivalence or define the Pfaffian condition.
The main manuscript is titled “Paired states and Hamiltonian cycles in cubic bipartite planar graphs,” but its supplied abstract contains only the claim of the main result. It gives no description of paired states or of the argument, so an account of the method cannot be reconstructed from this material. No companion manuscripts are supplied. The main result has a Lean formalization, but the available information does not identify which additional statements, including the asserted equivalence, are covered.
Useful notions
- Graphs as vertices joined by edges
- Vertex degree
- Cycles and visits to vertices
- Bipartite partitions and planar drawings
- Connectivity after vertex deletion
What was known before / what is new
Before
The source presents the target statement as Barnette’s conjecture. It supplies no earlier partial results, historical chronology, or account of previous methods.
New
The main manuscript claims that every finite simple cubic bipartite planar -vertex-connected graph has a Hamiltonian cycle. The repository summary describes this as resolving the conjecture and states the equivalent formulation involving prescribed three-edge paths in Pfaffian graphs. The main result has a Lean formalization, whose detailed scope is not supplied.
Limits and assumptions
The main statement requires all the listed hypotheses: finiteness, simplicity, degree three at every vertex, bipartiteness, planarity, and -vertex-connectivity. The supplied material makes no claim about dropping any of them. The Pfaffian formulation has its own explicitly stated hypotheses, and neither its equivalence to the planar statement nor its formalization coverage is explained here. The main result has a Lean formalization, but the abstract provides no argument or verification details. No remaining open questions are identified in the supplied text.
Mini glossary
- Hamiltonian cycle —
- A closed route in a graph that visits every vertex exactly once before returning to its starting vertex.
- Simple graph —
- A graph with no edge joining a vertex to itself and no multiple edges between the same two vertices.
- Cubic graph —
- A graph in which every vertex has exactly three incident edges.
- Bipartite graph —
- A graph whose vertices split into two sets so that every edge joins vertices in different sets.
- Planar graph —
- A graph that can be drawn in the plane without edges crossing.
- 3-vertex-connected graph —
- A graph with at least four vertices that stays connected after deleting any one or two vertices.
Keywords : Barnette’s conjecture · Hamiltonian cycles · Cubic bipartite planar graphs
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
Proves that every finite simple cubic bipartite planar 3-vertex-connected graph has a Hamiltonian cycle, resolving Barnette's conjecture. Equivalently, every three-edge path in a finite simple cubic 3-vertex-connected bipartite Pfaffian graph lies in a Hamiltonian cycle.
Verified by Lean: the Lean software checked the part of the reasoning described below, sometimes only part of the manuscript. This does not mean independent mathematicians have validated the result.
Manuscripts in this family
Paired states and Hamiltonian cycles in cubic bipartite planar graphs
24/09/2026We prove Barnette's conjecture: every finite simple cubic bipartite planar 3-vertex-connected graph has a Hamiltonian cycle.