A stability theorem for embedding bounded degree spanning trees
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911726075641856 |
|---|---|
| author | Csaba, Béla |
| author_facet | Csaba, Béla |
| contents | We prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma, instead we apply a vertex decomposition theorem by the author, which does not require a tower-type lower bound for $n.$ |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_29080 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A stability theorem for embedding bounded degree spanning trees Csaba, Béla Combinatorics We prove that if an $n$-vertex graph $G$ is non-extremal and $T$ is a bounded degree tree on $n$ vertices, then $T\subset G$ even when the minimum degree of $G$ is less than $n/2$ by a linear term. We avoid the use of the Regularity lemma, instead we apply a vertex decomposition theorem by the author, which does not require a tower-type lower bound for $n.$ |
| title | A stability theorem for embedding bounded degree spanning trees |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.29080 |