Metraipolis › archive › dc_944774d06d2e
Acyclic Dicolourings of Oriented Graphs: Paths, Random Tournaments, and Critical Orders — arXiv:2609.22931
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22931
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:44:41.249Z
- SHA-256 of the archived text
4cfe420b63c6d1a54f2368a12e5bc89e47bec127b4ca52191cbefc9142f32b3e- Stable URL of this page
https://metraipolis.com/documento/dc_944774d06d2e
How to cite
Acyclic Dicolourings of Oriented Graphs: Paths, Random Tournaments, and Critical Orders — arXiv:2609.22931 — arXiv (en), https://arxiv.org/abs/2609.22931 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_944774d06d2e (Metraipolis archive dc_944774d06d2e, sha256 4cfe420b63c6d1a54f2368a12e5bc89e47bec127b4ca52191cbefc9142f32b3e)
BibTeX
@misc{dc944774d06d2e,
title = {Acyclic Dicolourings of Oriented Graphs: Paths, Random Tournaments, and Critical Orders — arXiv:2609.22931},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22931},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_944774d06d2e; sha256 4cfe420b63c6d1a54f2368a12e5bc89e47bec127b4ca52191cbefc9142f32b3e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22931. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
An acyclic dicolouring of an oriented graph is a vertex partition in which every colour class and every bipartite subdigraph induced by two classes is acyclic. We first prove the Gallai--Roy-type bound $\vec{\chi}_a(D)\leq L(D)$, where $L(D)$ is the maximum order of a directed path. Let $r=\log_2(8/7)$. Bang-Jensen, Picasarri-Arrieta, and Yeo previously constructed tournaments of order $n$ whose acyclic dichromatic number is at least $n-(\frac8r)\log_2 n-\log_2\log_2 n$. We improve the leading logarithmic coefficient by a factor of two: for the uniform random tournament $\mathcal{T}_n$, asymptotically almost surely, $\vec{\chi}_a(\mathcal{T}_n)\geq n-\frac4r\log_2 n+\frac2r\log_2\log_2 n-O(1)$. Finally, if $m(k)$ denotes the minimum order of an oriented graph with acyclic dichromatic number at least $k$, tournament completion shows that the same minimum is obtained over tournaments. We prove $m(3)=5$ and $m(4)=7$ and classify the tournament witnesses at these minimum orders: there is one at order five and two at order seven.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.22931 — 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-09T21:26:41.101Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).