Towards the Erdős matching conjecture for 4-uniform hypergraphs: stability and applications

Peter Frankl, Hongliang Lu, Jie Ma +1

A famous conjecture of Erdős asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{…