{"schema":"postcutoff/event@1","as_of":"2026-10-23T13:24:00+02:00","url":"https://postcutoff.com/e/2026-10-21-barnette-conjecture-openai-proof-zhentao-li-exposition/","md":"https://postcutoff.com/e/2026-10-21-barnette-conjecture-openai-proof-zhentao-li-exposition/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-21-barnette-conjecture-openai-proof-zhentao-li-exposition","date":"2026-10-21","date_precision":"day","short_title":"Barnette's 1969 Hamiltonicity conjecture","deck":"Graph theorist Zhentao Li publishes a digested, partly re-proved version of OpenAI's proof","takeaway":"OpenAI's 6 Oct release claimed Barnette's conjecture (every cubic 3-connected bipartite planar graph is Hamiltonian), with a Lean proof. A combinatorialist has now written the argument out by hand, replacing its exponential-sum step with explicit sign-reversing involutions.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":[{"n":1,"title":"arXiv 2610.30490: Zhentao Li, A note on the proof of Barnette's conjecture","url":"https://arxiv.org/abs/2610.30490","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"OpenAI: Paired states and Hamiltonian cycles in cubic bipartite planar graphs (24 Sep manuscript)","url":"https://github.com/openai/math/blob/main/preprints/Paired-states-and-Hamiltonian-cycles-in-cubic-bipartite-planar-graphs-September-24-2026/paper.pdf","type":"paper","group":"primary","domain":"github.com"},{"n":3,"title":"openai/math CONTENTS.md (family 180, Lean link)","url":"https://github.com/openai/math/blob/main/CONTENTS.md","type":"code","group":"primary","domain":"github.com"}],"official":3,"filed":"2026-10-23","updated":"2026-10-23","orgs":["OpenAI"],"title":"Barnette's 1969 Hamiltonicity conjecture: graph theorist Zhentao Li publishes a digested, partly re-proved version of OpenAI's proof","summary":"OpenAI's 6 Oct 2026 math release (family 180, manuscript \"Paired states and Hamiltonian cycles in cubic bipartite planar graphs\", 24 Sep) claims Barnette's conjecture, with a Lean formalization listed in its catalogue. On 21 Oct Zhentao Li posted arXiv 2610.30490, \"a digested exposition of OpenAI's generated proof\", which keeps the proof \"essentially unchanged\" but replaces the complex-valued exponential sum with two sign-reversing involutions and proves a stronger statement: G − e has a Hamiltonian cycle for every Barnette graph G and edge e. Unrefereed.","key_facts":["Conjecture: David Barnette (1969): every cubic 3-connected bipartite planar graph has a Hamiltonian cycle; a weakening of Tait's disproved conjecture","OpenAI claim (CONTENTS.md, family 180): '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', with a Lean link","Li's note (arXiv 2610.30490, math.CO, 21 Oct): Theorem 3, for every Barnette graph G and every edge e0, G − e0 has a Hamiltonian cycle; main case cyclically 4-edge-connected, lower connectivity in Appendix C","Proof outline (Li): find a perfect matching of the face–black-vertex incidence graph minus N[b0] whose complement is a spanning tree; take the dual tree on white vertices; trace it into a spanning tree of G; orient towards w0 and delete e0 and the out-edges of white vertices; the remaining 2-factor is a Hamiltonian cycle. Existence of the matching is shown by counting with sign-reversing involutions","Li: 'The proof presented here is essentially unchanged, but replaces some parts of the generated proof with combinatorial arguments. In particular, we replace the complex-valued exponential sum with direct bijections (namely, two sign-reversing involutions).'","AI disclosure (verbatim): 'LLMs were used to read and understand the OpenAI preprint, to revise and format this note and to generate figures from their description.'"],"key_numbers":[],"tags":["math","graph-theory","combinatorics","barnette-conjecture","hamiltonian-cycles","openai","verification","exposition","lean"],"science":{"field":"mathematics","subfield":"graph theory","problem":"Barnette's conjecture (Hamiltonicity of cubic 3-connected bipartite planar graphs)","result":"Every cubic 3-connected bipartite planar graph has a Hamiltonian cycle; indeed G − e is Hamiltonian for every edge e (claimed by OpenAI; written out and partly re-proved by Li).","open_since":"1969","ai_system":["OpenAI internal model (unreleased)"],"human_role":"Autonomous AI proof (OpenAI release); Zhentao Li re-derived it by hand with combinatorial replacements, using LLMs to read the preprint and format the note","verification":{"key":"lean-unreviewed","label":"Lean proof, not yet reviewed","text":"Lean formalization by OpenAI (statement not independently reviewed by us); re-proved in digested form by a named independent graph theorist (arXiv 2610.30490); unrefereed"},"status":"confirmed","shock":"A 57-year-old, widely known graph-theory conjecture whose proof an outside expert could compress into a 14-page note."},"body_md":"## What happened\n\nBarnette's conjecture is one of the best-known open problems on Hamiltonian cycles in planar graphs. OpenAI's 6 Oct release listed a proof as family 180, with a Lean formalization in its catalogue.\n\nOn 21 Oct Zhentao Li posted [arXiv 2610.30490](https://arxiv.org/abs/2610.30490), a 14-page \"digested exposition\". He keeps OpenAI's strategy: a perfect matching in an auxiliary face–vertex graph whose complement is a spanning tree, which is traced into a spanning tree of G and turned into a Hamiltonian cycle. He replaces the generated proof's complex-valued exponential sum with two sign-reversing involutions and proves the stronger statement that G − e is Hamiltonian for every edge e. He used LLMs to read the OpenAI preprint and to format the note.\n\nNo other expert reactions were found on 23 Oct (X not searched).\n\n## Why it matters\n\nWith Thompson's group F and Nagata's conjecture, Barnette's conjecture is now the third headline claim of OpenAI's release that an outside specialist has written out by hand. Here the claim also has a machine-checked proof from OpenAI, so the human exposition mainly adds readability and a second, partly independent argument.","disputed":[],"related":[{"id":"2026-10-21-nagata-conjecture-openai-proof-tevelev-exposition","url":"https://postcutoff.com/e/2026-10-21-nagata-conjecture-openai-proof-tevelev-exposition/","date":"2026-10-21","date_precision":"day","short_title":"Nagata's 1959 conjecture","deck":"Algebraic geometer Jenia Tevelev writes out OpenAI's 'remarkably simple' proof and calls the release 'a stunning achievement'","takeaway":"Nagata's conjecture on plane curves through very general points, open since 1959, was one of the claims in OpenAI's 6 Oct maths release. A UMass Amherst specialist has now reorganized, simplified and published the full proof himself, while criticizing how the manuscripts were dumped on the community.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":3,"official":3,"filed":"2026-10-22","updated":"2026-10-22","orgs":["OpenAI","UMass Amherst"]},{"id":"2026-10-13-thompson-group-f-nonamenable-kim-lodha-exposition","url":"https://postcutoff.com/e/2026-10-13-thompson-group-f-nonamenable-kim-lodha-exposition/","date":"2026-10-13","date_precision":"day","short_title":"Thompson's group F is nonamenable","deck":"Specialists Sang-hyun Kim and Yash Lodha publish a human-written version of OpenAI's proof","takeaway":"The amenability of Thompson's group F, open since the 1970s, was one of the headline claims of OpenAI's 6 Oct math release. Two experts on groups of piecewise linear maps have now written the proof out themselves and generalized it, without AI.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":3,"official":3,"filed":"2026-10-14","updated":"2026-10-19","orgs":["OpenAI","KIAS","Purdue University"]},{"id":"2026-10-06-openai-math-release-722-manuscripts","url":"https://postcutoff.com/e/2026-10-06-openai-math-release-722-manuscripts/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems","deck":"Including quasi-Riemann, Unique Games, Hodge for CM abelian varieties and free group factors","takeaway":"If even a fraction of these results hold up, this is the largest single jump in mathematical knowledge on record, produced by an AI system in about six weeks.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":84,"official":13,"filed":"2026-10-07","updated":"2026-10-20","orgs":["OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-23","type":"filed","text":"Created (PDF read)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-23","run":null,"sources_read":"PDF read","updated":"2026-10-23","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":174,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":113,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":204,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":143,"in_training_data":false}],"short_url":"https://postcutoff.com/s/graph-theorist-zhentao-li"}