Mathematika Математика (общая)
Towards the Erdős matching conjecture for 4‐uniform hypergraphs: Stability and applications
Аннотация
Abstract A famous conjecture of Erdős asserts that for , the maximum number of edges in an ‐vertex ‐uniform hypergraph without pairwise disjoint edges is . This problem has been central in extremal combinatorics, with substantial progress in the literature, including a complete solution for due to the first author. In this paper, we make progress towards the 4‐uniform case, proving the conjecture for and sufficiently large , thereby taking a first step analogous to the 3‐uniform case. The main technical contribution is a stability result of independent interest. We further apply this stability to resolve two new instances of conjectures on the minimum ‐degree threshold for matchings in 5‐ and 6‐uniform hypergraphs, in a strengthened form.