Chi-boundedness of graphs containing no cycles with $k$ chords
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909761249738752 |
|---|---|
| author | Lee, Joonkyung Letzter, Shoham Pokrovskiy, Alexey |
| author_facet | Lee, Joonkyung Letzter, Shoham Pokrovskiy, Alexey |
| contents | We prove that the family of graphs containing no cycle with exactly $k$-chords is $χ$-bounded, for $k$ large enough or of form $\ell(\ell-2)$ with $\ell \ge 3$ an integer. This verifies (up to a finite number of values $k$) a conjecture of Aboulker and Bousquet (2015). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_14860 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Chi-boundedness of graphs containing no cycles with $k$ chords Lee, Joonkyung Letzter, Shoham Pokrovskiy, Alexey Combinatorics We prove that the family of graphs containing no cycle with exactly $k$-chords is $χ$-bounded, for $k$ large enough or of form $\ell(\ell-2)$ with $\ell \ge 3$ an integer. This verifies (up to a finite number of values $k$) a conjecture of Aboulker and Bousquet (2015). |
| title | Chi-boundedness of graphs containing no cycles with $k$ chords |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2208.14860 |