{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-10-02-tomon-triangle-free-box-graphs-astra/","md":"https://postcutoff.com/e/2026-10-02-tomon-triangle-free-box-graphs-astra/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-02-tomon-triangle-free-box-graphs-astra","date":"2026-10-02","date_precision":"day","short_title":"ChatGPT Astra finds geometric triangle-free graphs with near-optimal chromatic number, the first improvement on Burling's 1965 box bound","deck":null,"takeaway":"On Oct 2, 2026 István Tomon (Umeå University) posted geometric constructions of triangle-free and high-girth graphs with rapidly growing chromatic number.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.03517: Geometric triangle-free graphs of large chromatic number","url":"https://arxiv.org/abs/2610.03517","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-10-05","updated":"2026-10-05","orgs":["Umeå University","OpenAI"],"title":"ChatGPT Astra finds geometric triangle-free graphs with near-optimal chromatic number, the first improvement on Burling's 1965 box bound","summary":"On Oct 2, 2026 István Tomon (Umeå University) posted geometric constructions of triangle-free and high-girth graphs with rapidly growing chromatic number. The headline result is a triangle-free intersection graph of n boxes in R³ with chromatic number (log n)^(1−o(1)). He calls it the first improvement over Burling's double-logarithmic bound from 1965, and it nearly matches the O(log n) upper bound. The paper states: \"The constructions presented in this paper were found by ChatGPT Astra after guidance from the author.\"","key_facts":["arXiv 2610.03517 (math.CO), 'Geometric triangle-free graphs of large chromatic number', Oct 2, 2026","Boxes in R³: triangle-free intersection graph with independence number n(log n)^(−1+o(1)), so χ = (log n)^(1−o(1)); answers a question of Walczak","Unit-distance graphs: if R^d has a unit-distance graph with chromatic number r, it also has an induced one with girth ≥ g and the same chromatic number","Lines in R³ and circle tangency graphs with girth ≥ g and χ = Ω_g((log n)^(1−o(1))), improving Davies and Davies–Keller–Kleist–Smorodinsky–Walczak and giving an alternative solution of Ringel's circle problem; ordered graphs motivated by the Gyárfás–Sumner conjecture","AI declaration: 'The constructions presented in this paper were found by ChatGPT Astra after guidance from the author.' And: 'We instructed ChatGPT Astra to look specifically for parametric families, which quickly led to the main ideas presented in this paper.'"],"key_numbers":[],"tags":["math","combinatorics","discrete-geometry","graph-coloring","gpt-6-astra","ai-for-math"],"science":{"field":"mathematics","subfield":"combinatorics / discrete geometry","problem":"Chromatic number of triangle-free geometric intersection graphs (boxes in R³; Burling 1965) and related girth problems","result":"Triangle-free box intersection graphs with χ = (log n)^(1−o(1)), plus girth-g unit-distance, line and circle-tangency constructions.","open_since":"1965","ai_system":["GPT-6 Astra"],"human_role":"AI-found constructions: the author guided ChatGPT Astra (asking for parametric families), then wrote the exposition and analysis","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint"},"status":"pending","shock":""},"body_md":"## What happened\n\nBurling's 1965 construction gave triangle-free box intersection graphs whose chromatic number grows only like log log n. Tomon's preprint\nreaches (log n)^(1−o(1)), close to the known O(log n) ceiling, and adds several related girth results. He credits all the constructions to\nChatGPT Astra working under his guidance. In his words, \"While this construction might seem like it came out of nowhere … we try to illuminate\nhow it uses ideas from known constructions … (So we can also claim some credit.)\"\n\n## Why it matters\n\nThis is an exponential improvement on a 60-year-old bound in geometric graph colouring, and it is another case where the model supplied\nthe constructions rather than routine checks. It is a preprint with no reactions 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-15-erdos-108-high-girth-problem-disproved-conjectures-io","url":"https://postcutoff.com/e/2026-09-15-erdos-108-high-girth-problem-disproved-conjectures-io/","date":"2026-09-15","date_precision":"day","short_title":"Erdős–Hajnal high-girth problem (Erdős #108) disproved with ChatGPT/Codex help and a Lean proof, via the Conjectures.io bounty; experts sharpen it with GPT-6 Astra","deck":null,"takeaway":"This is a well-known problem from Erdős's list, and the counterexample comes with a machine-checked proof.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":7,"official":7,"filed":"2026-10-05","updated":"2026-10-07","orgs":["Conjectures.io","Purdue University","OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-05","type":"filed","text":"Created (AI declaration read in the PDF)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-05","run":null,"sources_read":"AI declaration read in the PDF","updated":"2026-10-05","human_review":null,"version":{"date":"2026-10-06"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":124,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":94,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":185,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":124,"in_training_data":false}],"short_url":null}