{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-09-29-lovasz-conjecture-nearly-linear-bound-gpt-5-6-sol/","md":"https://postcutoff.com/e/2026-09-29-lovasz-conjecture-nearly-linear-bound-gpt-5-6-sol/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-09-29-lovasz-conjecture-nearly-linear-bound-gpt-5-6-sol","date":"2026-09-29","date_precision":"day","short_title":"GPT-5.6 Sol supplies key steps in a nearly linear bound for the Lovász path conjecture","deck":null,"takeaway":"On Sept 29, 2026 Bowen Li and Abhishek Methuku posted a proof that every connected vertex-transitive graph on n vertices contains a cycle of length n^(1−o(1)).","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2609.38135: A nearly linear bound for the Lovász conjecture","url":"https://arxiv.org/abs/2609.38135","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"arXiv 2606.09742: Towards the Lovász conjecture via sublinear expanders (previous n^(2/3) bound)","url":"https://arxiv.org/abs/2606.09742","type":"paper","group":"primary","domain":"arxiv.org"},{"n":3,"title":"arXiv 2609.30165: Thinning and sprinkling, from robust sampling to almost Hamiltonicity (Christoph, Hunter, Sudakov)","url":"https://arxiv.org/abs/2609.30165","type":"paper","group":"primary","domain":"arxiv.org"}],"official":3,"filed":"2026-10-05","updated":"2026-10-05","orgs":["OpenAI"],"title":"Lovász conjecture (1969): long paths in vertex-transitive graphs pushed to n^(1−o(1)), with GPT-5.6 Sol supplying key steps","summary":"On Sept 29, 2026 Bowen Li and Abhishek Methuku posted a proof that every connected vertex-transitive graph on n vertices contains a cycle of length n^(1−o(1)). The previous bound was n^(2/3−o(1)), set earlier in 2026. This is the strongest general progress so far towards Lovász's 1969 conjecture that every such graph has a Hamiltonian path. The paper's AI statement says GPT-5.6 Sol pointed the authors to two key tools (the Tessera–Tointon structure theorem and Babai's contraction lemma) and \"supplied the required group-theoretic arguments\" for the last missing lemma.","key_facts":["arXiv 2609.38135 (math.CO), 'A nearly linear bound for the Lovász conjecture', Bowen Li and Abhishek Methuku, Sept 29, 2026","Result: every connected vertex-transitive graph on n vertices has a cycle (and path) of length n^(1−o(1)); the previous record n^(2/3−o(1)) was by Bucić, Christoph, Pokrovskiy and Steiner (arXiv 2606.09742, June 2026); Babai's 1979 bound was about √n","AI statement: 'In July 2026, when the authors asked OpenAI's GPT-5.6 Sol whether a decomposition into vertex-transitive parts is possible, it directed them to the structure theorem of Tessera and Tointon'","AI statement: for the small-orbit case 'GPT pointed them to Babai's contraction lemma', and 'GPT supplied the required group-theoretic arguments for controlling both the number and the word lengths of the required generators (Lemma 6.1) … This provided the key remaining step'","Human part (per the paper): the 2025 spanning-tree traversal plus Lovász local lemma strategy and the path-lifting bound (Lemma 5.7) were the authors' own","Context: Christoph, Hunter and Sudakov (arXiv 2609.30165, Sept 24, no AI disclosure) separately showed (1−o(1))n cycles when the degree is polylogarithmically large"],"key_numbers":[],"tags":["math","combinatorics","graph-theory","hamiltonicity","vertex-transitive-graphs","gpt-5-6","ai-for-math"],"science":{"field":"mathematics","subfield":"combinatorics / graph theory","problem":"Lovász conjecture (1969): every connected vertex-transitive graph has a Hamiltonian path; quantitative version, the longest guaranteed cycle","result":"Every connected vertex-transitive graph on n vertices contains a cycle of length n^(1−o(1)), up from n^(2/3−o(1)).","open_since":"1969","ai_system":["GPT-5.6 Sol"],"human_role":"Human-led with substantive AI input: the authors' framework; GPT-5.6 Sol found two key literature tools and supplied the group-theoretic Lemma 6.1","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint"},"status":"pending","shock":""},"body_md":"## What happened\n\nLovász asked in 1969 whether every connected vertex-transitive graph has a Hamiltonian path. For decades the best general guarantee was a cycle of length about √n (Babai, 1979). In 2026 the bound moved quickly:\nfirst n^(2/3−o(1)) by Bucić, Christoph, Pokrovskiy and Steiner (June), and now n^(1−o(1)) by Li and Methuku.\n\nThe paper has a detailed \"Statement of AI use\". The authors had a 2025 strategy: traverse a spanning tree of the quotient graph repeatedly\nand use the Lovász local lemma to join random short paths. It worked only if the vertex set could be split into large vertex-transitive\nparts. In July 2026 GPT-5.6 Sol directed them to the Tessera–Tointon structure theorem, which supplies such a partition, and the\nlarge-orbit cases followed \"quickly\". For the small-orbit case GPT pointed them to Babai's contraction lemma, which reduces the problem\nto Cayley graphs of nilpotent groups. When the authors could not bound the word lengths of the generators they needed, \"GPT supplied\nthe required group-theoretic arguments\" (Lemma 6.1), \"the key remaining step\".\n\n## Why it matters\n\nThis is a large quantitative step on a famous 57-year-old problem in graph theory. The disclosure follows a pattern seen across 2026: the\nmodel did not produce the whole proof, but it supplied the right literature tools and one hard lemma. The conjecture itself (a full\nHamiltonian path) remains open. The result is an unrefereed preprint, and no expert reactions were found as of Oct 5.","disputed":[{"label":"Verification","text":"Unrefereed preprint","sources":[]}],"related":[{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":11,"official":5,"filed":"2026-09-30","updated":"2026-10-19","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]},{"id":"2026-09-16-chvatal-conjecture-proved","url":"https://postcutoff.com/e/2026-09-16-chvatal-conjecture-proved/","date":"2026-09-16","date_precision":"day","short_title":"Chvátal's 1972 conjecture proved (Chang–Liu–Liu, ChatGPT-assisted), then a GPT-6 Astra 'proof from The Book' and a Codex-built Lean formalization","deck":null,"takeaway":"It is a clear example of the late-2026 pattern in mathematics.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":4,"official":4,"filed":"2026-10-01","updated":"2026-10-07","orgs":["Institute for Basic Science","OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-05","type":"filed","text":"Created (a PDF scan found the AI statement at the end of the paper)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-05","run":null,"sources_read":null,"updated":"2026-10-05","human_review":null,"version":{"date":"2026-10-07"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":121,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":91,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":182,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":121,"in_training_data":false}],"short_url":null}