Metraipolis › archive › dc_ef619fc093f7
Extremal hypergraphs without generalized 4-cycles — arXiv:2609.37744
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37744
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:33:42.534Z
- SHA-256 of the archived text
77ffbd36816cc8022bb0614225ff1638057c3ce8d356829c122e0e8d72eb6c0b- Stable URL of this page
https://metraipolis.com/documento/dc_ef619fc093f7
How to cite
Extremal hypergraphs without generalized 4-cycles — arXiv:2609.37744 — arXiv (en), https://arxiv.org/abs/2609.37744 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ef619fc093f7 (Metraipolis archive dc_ef619fc093f7, sha256 77ffbd36816cc8022bb0614225ff1638057c3ce8d356829c122e0e8d72eb6c0b)
BibTeX
@misc{dcef619fc093f7,
title = {Extremal hypergraphs without generalized 4-cycles — arXiv:2609.37744},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37744},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ef619fc093f7; sha256 77ffbd36816cc8022bb0614225ff1638057c3ce8d356829c122e0e8d72eb6c0b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37744. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In 1977, Erdős posed the problem of determining the maximum number $f_r(n)$ of edges in an $n$-vertex $r$-uniform hypergraph in which all disjoint pairs of edges have distinct unions. Füredi later conjectured that, for every fixed $r\ge 4$ and all sufficiently large $n$, $f_r(n)=\binom{n-1}{r-1}+\lfloor \frac{n-1}{r}\rfloor$. In this paper, we prove this conjecture and determine all extremal configurations. Our proof combines a stability theorem for such dense hypergraphs with a delicate deletion argument applied to an associated bipartite $3$-graph. The stability theorem also resolves a conjecture of Mubayi.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.37744 — 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-07T17:59:19.231Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).