Fractional clique decompositions of dense hypergraphs
Bulletin of the London Mathematical Society · 2026-05 · 58 (5)
DOI: 10.1112/blms.70382 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bulletin of the London Mathematical Society, online erschienen am 19.05.2026. Verfasst von Michelle Delcourt und 2 weiteren Autor:innen. Die Arbeit nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Natural Sciences and Engineering Research Council of Canada, University of Waterloo.
Abstract (Originalsprache)
In 2014, Keevash famously proved the existence of ‐Steiner systems as part of settling the Existence Conjecture of Combinatorial Designs (dating from the mid‐1800s). In 2020, Glock, Kühn, and Osthus conjectured a minimum degree generalization: specifically that minimum ‐degree at least suffices to guarantee that every sufficiently large ‐divisible ‐uniform hypergraph on vertices admits a ‐decomposition (where is a constant that is allowed to depend on but not on ). The best‐known progress on this conjecture is from the second proof of the existence conjecture by Glock, Kühn, Lo, and Osthus in 2016 who showed that suffices. The fractional relaxation of the conjecture is crucial to improving the bound; for that, only the slightly better bound of was known due to Barber, Kühn, Lo, Montgomery, and Osthus from 2017. Our main result is to prove that suffices for the fractional relaxation. Combined with the work of Henderson and Postle from 2025, this also shows that such ‐divisible hypergraphs admit ‐decompositions.
Förderung
- Natural Sciences and Engineering Research Council of Canada
- University of Waterloo
Zitieren
APA
Delcourt, M., Lesgourgues, T., & Postle, L. (2026). Fractional clique decompositions of dense hypergraphs. Bulletin of the London Mathematical Society, 58(5). https://doi.org/10.1112/blms.70382
Vancouver
Delcourt M, Lesgourgues T, Postle L. Fractional clique decompositions of dense hypergraphs. Bulletin of the London Mathematical Society. 2026;58(5). doi:10.1112/blms.70382
BibTeX
@article{Delcourt2026,
author = {Delcourt, Michelle and Lesgourgues, Thomas and Postle, Luke},
title = {Fractional clique decompositions of dense hypergraphs},
journal = {Bulletin of the London Mathematical Society},
year = {2026},
volume = {58},
number = {5},
doi = {10.1112/blms.70382}
}
EUVIMED