{
  "abstract": "Recently, Chudnovsky, Cook, Davies, Oum, and Tan obtained the first finite bound on the chromatic number of t-perfect graphs, showing that they are 199053-colorable. We improve this bound to 130 by refining their proof. The original proof establishes that every graph with large odd girth and large chromatic number contains a certain structure called an r-arithmetic rope, and that its existence in a certain leveling of a graph with large odd girth would imply an odd wheel as a t-minor, a known obstruction to t-perfectness. While their technique requires a lower bound on the chromatic number that is exponential in r, we show that the existence of an r-arithmetic rope can already be guaranteed under a linear bound. Using a slightly weakened notion of arithmetic ropes allows us to reduce the bound even further.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2607.05961",
  "author_total": 2,
  "authors": [
    {
      "name": "Matija Novaković"
    },
    {
      "name": "Stefan Weltge"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/1k9ps6em71gas.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2607.05961",
  "fulltext_url": null,
  "id": "1k9ps6em71gas",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2607.05961",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.DM"
    ],
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W7167715603",
  "pdf_url": "https://arxiv.org/pdf/2607.05961",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-29",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/1k9ps6em71gas.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:36:32Z",
      "native_id": "2607.05961",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2607.05961"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Coloring t-perfect graphs with fewer colors",
  "title_text": "Coloring t-perfect graphs with fewer colors",
  "type": "preprint",
  "updated_at": "2026-11-01T12:20:50Z",
  "url": "https://research.draconitic.com/paper/1k9ps6em71gas",
  "venue": "arXiv",
  "versions": []
}