On the Turánability and tileability of oriented graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911527054868480 |
|---|---|
| author | Araujo, Igor Xiang, Zimu |
| author_facet | Araujo, Igor Xiang, Zimu |
| contents | An oriented graph $H$ is Turánable (resp. tileable) if there exist $n_0 \in \mathbb{N}$ such that every semi-regular near-tournament on $n \ge n_0$ vertices contains a copy of $H$ (resp. a perfect $H$-tiling). We disprove a conjectured characterization of Turánable oriented graphs by DeBiasio, Han, Lo, Molla, Piga, and Treglown, show that there are Turánable oriented graphs which are not tileable, and provide a new example of tileable oriented graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_13267 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Turánability and tileability of oriented graphs Araujo, Igor Xiang, Zimu Combinatorics An oriented graph $H$ is Turánable (resp. tileable) if there exist $n_0 \in \mathbb{N}$ such that every semi-regular near-tournament on $n \ge n_0$ vertices contains a copy of $H$ (resp. a perfect $H$-tiling). We disprove a conjectured characterization of Turánable oriented graphs by DeBiasio, Han, Lo, Molla, Piga, and Treglown, show that there are Turánable oriented graphs which are not tileable, and provide a new example of tileable oriented graph. |
| title | On the Turánability and tileability of oriented graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2507.13267 |