Brown–Erdős–Sós problem
For integers and , let be the maximum number of edges in an -uniform hypergraph on vertices such that no set of distinct edges has union of size at most . For integers and , determine the exact asymptotic coefficient
where the limit is known to exist. In particular, the remaining unresolved case is to determine for even .
References
- Asymptotics of the Brown--Erdős--Sós problem at integer exponents — arXiv — Ting-Wei Chao, Xinqi Huang, Hong Liu
Source: arXiv
Progress summary
A September 2026 advance determines most leading coefficients, but the exceptional even-parameter family remains open.
Brown, Erdős, and Sós posed the problem in 1973: determine asymptotic densities for sparse uniform hypergraphs. The broader limit-existence question is now settled, while determining the exact coefficient remains incomplete.
Known results
- Brown, Erdős, and Sós (1973) proved the base case .
- Glock (2019) proved the case.
- Glock, Joos, Kim, Kühn, Lichev, and Pikhurko (2024) proved .
- Delcourt and Postle (2023) proved existence of the limit for every when ; related work extends existence to all uniformities.
September 2026 leading-coefficient advance
Ting-Wei Chao, Xinqi Huang, and Hong Liu claim explicit formulas for odd and for even with , and prove a coefficient greater than for the remaining even-, family. This is substantial claimed progress, but that exceptional family is not resolved.
Current status (as of September 2026): Limit existence is settled broadly and many exact coefficients are known, but the even-, coefficient problem remains open; the latest formulas are an unverified preprint claim.
Solutions 0
No solutions have been posted yet.