--- id: "2026-10-02-tomon-triangle-free-box-graphs-astra" url: "https://postcutoff.com/e/2026-10-02-tomon-triangle-free-box-graphs-astra/" as_of: "2026-11-22T13:32:00+01:00" date: "2026-10-02" date_precision: day category: science importance: 3 confidence: high status: [Event confirmed, Awaiting review] verification: Preprint only sources: 1 editor: human editor human_review: null version: "2026-10-06" --- As of: 2026-11-22 13:32 CET. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/e/2026-10-02-tomon-triangle-free-box-graphs-astra/ # ChatGPT Astra finds geometric triangle-free graphs with near-optimal chromatic number, the first improvement on Burling's 1965 box bound 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.' ## What happened Burling's 1965 construction gave triangle-free box intersection graphs whose chromatic number grows only like log log n. Tomon's preprint reaches (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 ChatGPT Astra working under his guidance. In his words, "While this construction might seem like it came out of nowhere … we try to illuminate how it uses ideas from known constructions … (So we can also claim some credit.)" ## Why it matters This is an exponential improvement on a 60-year-old bound in geometric graph colouring, and it is another case where the model supplied the constructions rather than routine checks. It is a preprint with no reactions found as of Oct 5. ## What is disputed or not yet verified - Verification: Unrefereed preprint ## Your AI and this story - GPT-6.2 Astra (training cutoff May 2026): 124 days after its cutoff - Claude Opus 5.5 (training cutoff June 2026): 94 days after its cutoff - Gemini 4 Hydrogen (training cutoff March 2026): 185 days after its cutoff - Grok 4.7 (training cutoff May 2026): 124 days after its cutoff ## Sources 1. [arXiv 2610.03517: Geometric triangle-free graphs of large chromatic number](https://arxiv.org/abs/2610.03517) (arxiv.org, paper) ## Changes - 2026-10-05 (filed): Created (AI declaration read in the PDF) ## Related - 2026-09-30: [Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help](https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/index.md) - 2026-09-15: [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](https://postcutoff.com/e/2026-09-15-erdos-108-high-girth-problem-disproved-conjectures-io/index.md)