Erdős meets Nash-Williams
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918108603613184 |
|---|---|
| author | Delcourt, Michelle Cicely Henderson Lesgourgues, Thomas Postle, Luke |
| author_facet | Delcourt, Michelle Cicely Henderson Lesgourgues, Thomas Postle, Luke |
| contents | In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In 1970, Nash-Williams conjectured that every graph $G$ on $n$ vertices with minimum degree at least $3n/4$ (for $n$ large enough and satisfying the necessary divisibility conditions) has a triangle decomposition. In 1973, Erdős conjectured that for each integer $g$, there exists a Steiner triple system on $n$ vertices with girth at least $g$ (provided that $n\equiv 1,3 \mod 6$ is large enough compared to the fixed $g$). In 2021, Glock, Kühn, and Osthus conjectured the common generalization of these two conjectures, dubbing it the ``Erdős meets Nash-Williams' Conjecture''.
In this paper, we reduce the combined conjecture to the fractional relaxation of the Nash-Williams' Conjecture. Combined with the best known fractional bound of Delcourt and Postle, this proves the combined conjecture above when $G$ has minimum degree at least $0.82733n$. We note that our result generalizes the seminal work of Barber, Kühn, Lo, and Osthus on Nash-Williams' Conjecture and the resolution of Erdős' Conjecture by Kwan, Sah, Sawhney, and Simkin. Both previous proofs of those results used the method of iterative absorption. Our proof instead proceeds via the newly developed method of refined absorption (and hence provides new independent proofs of both results). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_23624 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Erdős meets Nash-Williams Delcourt, Michelle Cicely Henderson Lesgourgues, Thomas Postle, Luke Combinatorics 05B07, 05B05, 05C35, 05C65 In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In 1970, Nash-Williams conjectured that every graph $G$ on $n$ vertices with minimum degree at least $3n/4$ (for $n$ large enough and satisfying the necessary divisibility conditions) has a triangle decomposition. In 1973, Erdős conjectured that for each integer $g$, there exists a Steiner triple system on $n$ vertices with girth at least $g$ (provided that $n\equiv 1,3 \mod 6$ is large enough compared to the fixed $g$). In 2021, Glock, Kühn, and Osthus conjectured the common generalization of these two conjectures, dubbing it the ``Erdős meets Nash-Williams' Conjecture''. In this paper, we reduce the combined conjecture to the fractional relaxation of the Nash-Williams' Conjecture. Combined with the best known fractional bound of Delcourt and Postle, this proves the combined conjecture above when $G$ has minimum degree at least $0.82733n$. We note that our result generalizes the seminal work of Barber, Kühn, Lo, and Osthus on Nash-Williams' Conjecture and the resolution of Erdős' Conjecture by Kwan, Sah, Sawhney, and Simkin. Both previous proofs of those results used the method of iterative absorption. Our proof instead proceeds via the newly developed method of refined absorption (and hence provides new independent proofs of both results). |
| title | Erdős meets Nash-Williams |
| topic | Combinatorics 05B07, 05B05, 05C35, 05C65 |
| url | https://arxiv.org/abs/2507.23624 |