Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908284851585024 |
|---|---|
| author | Koerts, Hidde Moore, Benjamin Spirkl, Sophie |
| author_facet | Koerts, Hidde Moore, Benjamin Spirkl, Sophie |
| contents | 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 $χ(D) \geq c$ and minimum out-degree at least $\varepsilon |V(D)|$ contains $C$ as a subdigraph. This generalizes a result of Thomassen. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20045 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Orientations of cycles in digraphs of high chromatic number and high minimum out-degree Koerts, Hidde Moore, Benjamin Spirkl, Sophie Combinatorics 05C20 (Primary) 05C38 (Secondary) 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 $χ(D) \geq c$ and minimum out-degree at least $\varepsilon |V(D)|$ contains $C$ as a subdigraph. This generalizes a result of Thomassen. |
| title | Orientations of cycles in digraphs of high chromatic number and high minimum out-degree |
| topic | Combinatorics 05C20 (Primary) 05C38 (Secondary) |
| url | https://arxiv.org/abs/2503.20045 |