Unavoidable cycle-contraction minors of large $2$-connected graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912725644345344 |
|---|---|
| author | Ge, Wayne Oxley, James |
| author_facet | Ge, Wayne Oxley, James |
| contents | It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_n$, $K_{1,n}$, or an $n$-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of sufficiently large $2$-connected graphs. In this paper, we establish a dual version of this theorem by focusing on the minors obtained by contracting cycles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20106 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Unavoidable cycle-contraction minors of large $2$-connected graphs Ge, Wayne Oxley, James Combinatorics It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_n$, $K_{1,n}$, or an $n$-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of sufficiently large $2$-connected graphs. In this paper, we establish a dual version of this theorem by focusing on the minors obtained by contracting cycles. |
| title | Unavoidable cycle-contraction minors of large $2$-connected graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2503.20106 |