Metraipolis › archive › dc_17a296cdc717
Clique Number of Tournaments II — arXiv:2609.07481
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.07481
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:47.510Z
- SHA-256 of the archived text
97c5625fc3bed48915e73292796362c5541d4036dfe4c9d3b735d64200b7c65e- Stable URL of this page
https://metraipolis.com/documento/dc_17a296cdc717
How to cite
Clique Number of Tournaments II — arXiv:2609.07481 — arXiv (en), https://arxiv.org/abs/2609.07481 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_17a296cdc717 (Metraipolis archive dc_17a296cdc717, sha256 97c5625fc3bed48915e73292796362c5541d4036dfe4c9d3b735d64200b7c65e)
BibTeX
@misc{dc17a296cdc717,
title = {Clique Number of Tournaments II — arXiv:2609.07481},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.07481},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_17a296cdc717; sha256 97c5625fc3bed48915e73292796362c5541d4036dfe4c9d3b735d64200b7c65e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07481. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The directed clique number $\vec{\omega}(T)$ of a tournament $T$ is the minimum, over all orderings of the vertices of $T$, of the clique number of the graph whose edges are the arcs that point backward with respect to the ordering. In this paper, we prove that, for every integer $k \geq 3$, deciding whether $\vec{\omega}(T) \leq k$ is NP-complete. This answers a question of Nguyen, Scott, and Seymour, and contrasts with the classical undirected setting, where deciding whether $\omega(G) \leq k$ is polynomial-time solvable for every fixed integer $k$. On the other hand, we give a polynomial-time algorithm distinguishing tournaments with $\vec{\omega}(T) \leq 2$ from those with $\vec{\omega}(T) > 100$. We also study the tournament analogue of the Gyárfás--Sumner conjecture. We construct new $\vec{\chi}$-bounding tournaments and thereby prove a conjecture of Aboulker, Aubian, Charbit, and Lopes stating that every class of tournaments with bounded twin-width is $\vec{\chi}$-bounded. We then exhibit new tournaments that are not $\vec{\chi}$-bounding, disproving another conjecture of Aboulker, Aubian, Charbit, and Lopes, as well as two conjectures of Kim. Finally, we present infinite families of 3-$\vec{\omega}$-critical and 4-$\vec{\omega}$-critical tournaments.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.07481 — 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-16T14:32:29.823Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).