Metraipolis › archive › dc_1f20bfd481e2
Fractional Triangle Decompositions at Partite Minimum Degree $4n/5$ — arXiv:2609.31758
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.31758
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:26:43.393Z
- SHA-256 of the archived text
4fde11b5183393f9e467352441c6ac03b819a06a97cb752a8debbe8cb5ec9761- Stable URL of this page
https://metraipolis.com/documento/dc_1f20bfd481e2
How to cite
Fractional Triangle Decompositions at Partite Minimum Degree $4n/5$ — arXiv:2609.31758 — arXiv (en), https://arxiv.org/abs/2609.31758 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1f20bfd481e2 (Metraipolis archive dc_1f20bfd481e2, sha256 4fde11b5183393f9e467352441c6ac03b819a06a97cb752a8debbe8cb5ec9761)
BibTeX
@misc{dc1f20bfd481e2,
title = {Fractional Triangle Decompositions at Partite Minimum Degree $4n/5$ — arXiv:2609.31758},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.31758},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1f20bfd481e2; sha256 4fde11b5183393f9e467352441c6ac03b819a06a97cb752a8debbe8cb5ec9761},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31758. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that every triangle-divisible balanced tripartite graph whose vertex classes have size $n$ and whose partite minimum degree is at least $4n/5$ admits a fractional triangle decomposition. Combined with the multipartite decomposition theorem of Barber, Kühn, Lo, Osthus, and Taylor, this implies that, for every fixed $\varepsilon<1/5$ and all sufficiently large $n$, every $\varepsilon$-dense partial Latin square of order $n$ is completable, improving the previous asymptotic bound of $2/25$. The fractional decomposition theorem is finite and exact. Its proof uses a minimum-weight perfect matching to normalize an arbitrary Farkas dual weighting, followed by an explicit direct-and-two-step routing scheme whose aggregate congestion on every off-matching edge is at most one. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.31758 — 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-10-07T23:08:10.734Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).