A survey of degree-boundedness
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915016844771328 |
|---|---|
| author | Du, Xiying McCarty, Rose |
| author_facet | Du, Xiying McCarty, Rose |
| contents | Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $χ$-boundedness but for minimum degree instead of chromatic number. We survey this area with an eye towards open problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_05737 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A survey of degree-boundedness Du, Xiying McCarty, Rose Combinatorics 05C42 Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $χ$-boundedness but for minimum degree instead of chromatic number. We survey this area with an eye towards open problems. |
| title | A survey of degree-boundedness |
| topic | Combinatorics 05C42 |
| url | https://arxiv.org/abs/2403.05737 |