OpenAlex ·
Extremal hypergraphs without generalized 4-cycles
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.37744
- Original
- Read it at the publisher
- Topics
Abstract
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.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
A Memory-Magic Exchange Law in Streaming Clifford+T Compilation
The twisted convolution identity and ghost $r$-SICs from finite quantum dilogarithms
Asymptotics of the Brown--Erdős--Sós problem at integer exponents
An elementary proof of the 2-regularity of Pythagorean triples
Twisted Diophantine Approximation I: Asymptotic Theory
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.