Year: 2026
Type: preprint
Abstract: Erdős and Sós conjectured that every $n$-vertex $3$-uniform hypergraph whose link graphs are all bipartite has at most $(1/4+o(1))\binom n3$ edges. We disprove this conjecture by constructing counterexamples with edge density at least $0.250000356>1/4$ for all sufficiently large $n$.
Source: arXiv (Cornell University)
Author: Yang, Tianchi
Institution: Georgia Institute of Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7221145181