Metraipolis › archive › dc_f07720fa5b17
Bounded Twin-Width Tournaments are $\dchi$-Bounded — arXiv:2609.02763
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.02763
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T05:38:49.139Z
- SHA-256 of the archived text
4d6f8ad7a5f98cf39dd016a3cab65aa12926520da9c94ddc5074bc431476bbfc- Stable URL of this page
https://metraipolis.com/documento/dc_f07720fa5b17
How to cite
Bounded Twin-Width Tournaments are $\dchi$-Bounded — arXiv:2609.02763 — arXiv (en), https://arxiv.org/abs/2609.02763 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f07720fa5b17 (Metraipolis archive dc_f07720fa5b17, sha256 4d6f8ad7a5f98cf39dd016a3cab65aa12926520da9c94ddc5074bc431476bbfc)
BibTeX
@misc{dcf07720fa5b17,
title = {Bounded Twin-Width Tournaments are $dchi$-Bounded — arXiv:2609.02763},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.02763},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f07720fa5b17; sha256 4d6f8ad7a5f98cf39dd016a3cab65aa12926520da9c94ddc5074bc431476bbfc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02763. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a tournament $T$ and a vertex ordering $\prec$, let $T^{\prec}$ be the graph of backward arcs in $\prec$. The diclique number of a tournament is $\domega(T)=\min_{\prec}\omega(T^{\prec})$, and the dichromatic number is $\dchi(T)=\min_{\prec}\chi(T^{\prec})$. We prove a mixed parameter transfer theorem: for all $k$ and $r$, if $\tww(T)\le k$ and $\omega(T^{\prec})\le r$, then the ordered twin-width of $(T^{\prec},\prec)$ is bounded by a function of $k$ and $r$. The proof combines the regular-semigrid theorem for ordered graphs with permutation-encoding obstructions to bounded twin-width in tournaments. Together with polynomial $\chi$-boundedness of graphs of bounded twin-width, this implies that tournaments of bounded twin-width are $\dchi$-bounded by $\domega$, resolving a conjecture of Aboulker, Aubian, Charbit, and Lopes.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.02763 — 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-10-17T04:59:51.790Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).