For every r≥3, the exact chromatic profile of the transitive tournament T_r is (3r-7)/(3r-4); directed odd cycles have 2-color profile 1/2, and the three non-directed pentagon orientations have 2-color profile 1/3.
Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We characterize all orientations of cycles $C$ for which for every fixed $\varepsilon > 0$ there exists a constant $c \geq 1$ such that every digraph $D$ without loops or parallel arcs with $\chi(D) \geq c$ and minimum out-degree at least $\varepsilon |V(D)|$ contains $C$ as a subdigraph. This generalizes a result of Thomassen.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A directed Andr\'asfai-Erd\H{o}s-S\'os theorem and chromatic profiles of oriented cycles
For every r≥3, the exact chromatic profile of the transitive tournament T_r is (3r-7)/(3r-4); directed odd cycles have 2-color profile 1/2, and the three non-directed pentagon orientations have 2-color profile 1/3.