Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2412.19912 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911317081718784 |
|---|---|
| author | Lang, Richard Sanhueza-Matamala, Nicolás |
| author_facet | Lang, Richard Sanhueza-Matamala, Nicolás |
| contents | We show that every graph $G$ on $n$ vertices with $δ(G) \geq (1/2+\varepsilon)n$ is spanned by a complete blow-up of a cycle with clusters of nearly uniform size $Ω(\log n)$. The proof is based on a recently introduced approach for finding vertex-spanning substructures via blow-up covers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_19912 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Blowing up Dirac's theorem Lang, Richard Sanhueza-Matamala, Nicolás Combinatorics We show that every graph $G$ on $n$ vertices with $δ(G) \geq (1/2+\varepsilon)n$ is spanned by a complete blow-up of a cycle with clusters of nearly uniform size $Ω(\log n)$. The proof is based on a recently introduced approach for finding vertex-spanning substructures via blow-up covers. |
| title | Blowing up Dirac's theorem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.19912 |