Edge-colouring and orientations: applications to degree- and $χ$-boundedness
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914476284968960 |
|---|---|
| author | Char, Arnab Kawarabayashi, Ken-ichi Picasarri-Arrieta, Lucas |
| author_facet | Char, Arnab Kawarabayashi, Ken-ichi Picasarri-Arrieta, Lucas |
| contents | We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive that every orientation of a graph with large minimum degree contains either a large transitive tournament or an induced antidirected digraph whose minimum degree is still large.
As a consequence, we obtain two general tools showing that certain extensions of degree-bounded graph classes preserve degree-boundedness. A hereditary class $\mathcal{G}$ is {\it degree-bounded} if, for every integer $s$, there exists $d=d(s)$ such that every graph $G\in \mathcal{G}$ either contains $K_{s,s}$ or has minimum degree at most $d$. With these tools, we obtain for instance that odd-signable graphs and Burling graphs are degree-bounded. We also characterise exactly the oriented graphs $F$ such that the graphs admitting an orientation without any induced copy of $F$ are degree-bounded. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_23054 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Edge-colouring and orientations: applications to degree- and $χ$-boundedness Char, Arnab Kawarabayashi, Ken-ichi Picasarri-Arrieta, Lucas Combinatorics We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive that every orientation of a graph with large minimum degree contains either a large transitive tournament or an induced antidirected digraph whose minimum degree is still large. As a consequence, we obtain two general tools showing that certain extensions of degree-bounded graph classes preserve degree-boundedness. A hereditary class $\mathcal{G}$ is {\it degree-bounded} if, for every integer $s$, there exists $d=d(s)$ such that every graph $G\in \mathcal{G}$ either contains $K_{s,s}$ or has minimum degree at most $d$. With these tools, we obtain for instance that odd-signable graphs and Burling graphs are degree-bounded. We also characterise exactly the oriented graphs $F$ such that the graphs admitting an orientation without any induced copy of $F$ are degree-bounded. |
| title | Edge-colouring and orientations: applications to degree- and $χ$-boundedness |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2506.23054 |