Unavoidable Induced Subgraph of Infinite 2-connected Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917857184448512 |
|---|---|
| author | Allred, Sarah Ding, Guoli Oporowski, Bogdan |
| author_facet | Allred, Sarah Ding, Guoli Oporowski, Bogdan |
| contents | In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. König proved that every infinite graph contains either a ray or a vertex of infinite degree. In this paper, we establish the 2-connected analog of these results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_06416 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Unavoidable Induced Subgraph of Infinite 2-connected Graphs Allred, Sarah Ding, Guoli Oporowski, Bogdan Combinatorics 05C75, 05C63 In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. König proved that every infinite graph contains either a ray or a vertex of infinite degree. In this paper, we establish the 2-connected analog of these results. |
| title | Unavoidable Induced Subgraph of Infinite 2-connected Graphs |
| topic | Combinatorics 05C75, 05C63 |
| url | https://arxiv.org/abs/2211.06416 |