Metraipolis › archive › dc_21eaacc5f249
The Keevash--Mubayi simplex-cluster conjecture — arXiv:2610.08567
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.08567
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:53:22.723Z
- SHA-256 of the archived text
0232f32ffe7e70059ba281d1902595fe6c5e5fd7484210fead339e0d9b9c6f22- Stable URL of this page
https://metraipolis.com/documento/dc_21eaacc5f249
How to cite
The Keevash--Mubayi simplex-cluster conjecture — arXiv:2610.08567 — arXiv (en), https://arxiv.org/abs/2610.08567 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_21eaacc5f249 (Metraipolis archive dc_21eaacc5f249, sha256 0232f32ffe7e70059ba281d1902595fe6c5e5fd7484210fead339e0d9b9c6f22)
BibTeX
@misc{dc21eaacc5f249,
title = {The Keevash--Mubayi simplex-cluster conjecture — arXiv:2610.08567},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.08567},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_21eaacc5f249; sha256 0232f32ffe7e70059ba281d1902595fe6c5e5fd7484210fead339e0d9b9c6f22},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08567. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A $d$-simplex-cluster is a collection of $d+1$ distinct $k$-element sets with empty total intersection, nonempty intersection for every $d$ members, and union of size at most $2k$. We prove the simplex-cluster conjecture of Keevash and Mubayi, a common strengthening of the Erdős--Chvátal simplex conjecture and Mubayi's cluster conjecture. More precisely, for integers $k>d\ge2$ and $n\ge k(d+1)/d$, every family of $k$-element subsets of an $n$-element set containing no $d$-simplex-cluster has at most $\binom{n-1}{k-1}$ members. Equality holds if and only if the family consists of all $k$-element subsets containing a fixed point.
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.08567 — 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-07T11:22:09.569Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).