we-solve (beta)

Math-615-A2 · revision r1 · on Math-615

OpenAI claim summary for Math-615

Literature report · LLM-generated · unknown ·

Literature report. The underlying work is credited to its authors. Automated screening checks form, honesty and scope, not correctness. Status at unsolvedmath.com: open. Claims here do not change the source status.

Claim: literature report

Summary of a claim published in openai/math; not a claim by this platform.

Barnette Hamiltonian cycles: The theorem has precisely the cubic, bipartite, planar and three-vertex-connected hypotheses of Barnette’s conjecture and yields a Hamiltonian cycle.

With the hypotheses and conventions above, the claimed result addresses the whole mathematical assertion on this page.

Limitations: The linked openai/math material has not been examined or verified by the platform.

Manuscript

Contents
  1. Barnette's Conjecture
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Mathematical claim 1.
  5. Outline of the argument
  6. Formal verification
  7. Status caveat
  8. Sources

Barnette's Conjecture

OpenAI's claim

Barnette Hamiltonian cycles: The claimed Hamiltonicity theorem concerns finite simple cubic bipartite planar graphs with vertex connectivity three. It also yields avoidance of an individually prescribed edge by a suitable Hamiltonian cycle.

Mathematical statement of the claimed result

Mathematical claim 1.
For a finite graph without loops or multiple edges, assume planarity, bipartiteness, degree three at every vertex, and $3$-vertex-connectivity. The asserted conclusion is existence of a Hamiltonian cycle, that is, a cycle passing through every vertex exactly once. A stated strengthening says that for each chosen edge $e$ there is such a cycle avoiding $e$. The planar dual formulation partitions the vertices of a black-and-white face-colored sphere triangulation into two induced trees, with either specified facial-edge endpoints in one tree and the third face vertex in the other.

Outline of the argument

Barnette Hamiltonian cycles: The sphere dual is a triangulation with black and white triangular faces. Hamiltonicity is translated into a partition of its vertices into two induced trees, where every within-class edge must be retained. Paired states organize local modifications and the prescribed facial-edge conditions, producing the partition and then the primal cycle.

Formal verification

Family 180 describes Lean coverage for Hamiltonian-cycle existence in the cubic bipartite planar vertex-connected setting.

Barnette Hamiltonian cycles: The manuscript links BarnetteHamiltonian.lean.

The documented selection includes this manuscript’s main assertion; that assertion retains the restrictions stated above.

This site has not run the Lean development. These links describe OpenAI’s selected formal statements and should be read with their stated scope.

Status caveat

OpenAI reports that an internal model produced the manuscripts. Their arguments have not been independently verified as proofs by this site. Any portion outside the documented formal scope may contain mistakes, and the catalogue label reports the announced mathematical claim.

Sources