Metraipolis › archive › dc_c2cbad88f4fb

Polylogarithmic bound for the Gyárfás-Sumner conjecture — arXiv:2611.06699

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06699
License (as archived)
CC0-1.0
Archived
2026-11-05T18:28:33.932Z
SHA-256 of the archived text
bfc98b2ab26b0e22b1ce7b290a823a21a60a01fee0630f66ba76d7a6280056b6
Stable URL of this page
https://metraipolis.com/documento/dc_c2cbad88f4fb

How to cite

Polylogarithmic bound for the Gyárfás-Sumner conjecture — arXiv:2611.06699 — arXiv (en), https://arxiv.org/abs/2611.06699 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c2cbad88f4fb (Metraipolis archive dc_c2cbad88f4fb, sha256 bfc98b2ab26b0e22b1ce7b290a823a21a60a01fee0630f66ba76d7a6280056b6)
BibTeX
@misc{dcc2cbad88f4fb,
  title = {Polylogarithmic bound for the Gyárfás-Sumner conjecture — arXiv:2611.06699},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06699},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c2cbad88f4fb; sha256 bfc98b2ab26b0e22b1ce7b290a823a21a60a01fee0630f66ba76d7a6280056b6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06699. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The classical Gyárfás-Sumner conjecture asserts that for any fixed forest $F$, any graph $G$ not containing $F$ as an induced subgraph, with bounded clique number $\omega(G)$, has bounded chromatic number $\chi(G)$. Recently, Nguyen, Scott, and Seymour proved that every such graph has chromatic number at most $|G|^{o(1)}$. We improve this bound to a polylogarithmic one $(\log |G|)^{O(1)}$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.06699 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:18:34.001Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).