Metraipolis › archive › dc_bee856e0b49d
A note on decompositions into 3-chromatic graphs — arXiv:2610.41266
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41266
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T05:00:32.245Z
- SHA-256 of the archived text
92f1754979bf49e6a37b7c912db8684906d5b1ea2ab5d1892e229fbf6befd5b4- Stable URL of this page
https://metraipolis.com/documento/dc_bee856e0b49d
How to cite
A note on decompositions into 3-chromatic graphs — arXiv:2610.41266 — arXiv (en), https://arxiv.org/abs/2610.41266 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bee856e0b49d (Metraipolis archive dc_bee856e0b49d, sha256 92f1754979bf49e6a37b7c912db8684906d5b1ea2ab5d1892e229fbf6befd5b4)
BibTeX
@misc{dcbee856e0b49d,
title = {A note on decompositions into 3-chromatic graphs — arXiv:2610.41266},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41266},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bee856e0b49d; sha256 92f1754979bf49e6a37b7c912db8684906d5b1ea2ab5d1892e229fbf6befd5b4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41266. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Delcourt and Postle recently introduced the `discharging in the dual' proof technique, leading to a breakthrough proof of Nash-Williams' conjecture on triangle decompositions. Independently, and almost simultaneously, the first and second authors built on the `condensation' method of Bryant, Dukes, Horsley, Maenhaut and Montgomery to determine the decomposition threshold of all odd cycles of length at least $73$. In this note, we explain how the `discharging in the dual' and `condensation' methods can be combined to determine the decomposition threshold of cycles of any odd length, as well as the approximate decomposition threshold of a range of other $3$-chromatic graphs. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.41266 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T04:47:57.673Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).