Year: 2025
Type: article
Abstract: The Erdős Matching Conjecture states that the maximum size 𝑓 (𝑛, 𝑘, 𝑠) of a family that does not contain 𝑠 pairwise disjoint sets is max. , where and . The case 𝑠 = 2 is simply the Erdős-Ko-Rado theorem on intersecting families and is well understood. The case 𝑛 = 𝑠𝑘 was settled by Kleitman and the uniqueness of the extremal construction was obtained by Frankl. Most results in this area show that if 𝑘, 𝑠 are fixed and 𝑛 is large enough, then the conjecture holds true. Exceptions are due to Frankl who proved the conjecture and considered variants for 𝑛 ∈ [𝑠𝑘, 𝑠𝑘 + 𝑐𝑠,𝑘 ] if 𝑠 is large enough compared to 𝑘. A recent manuscript by Guo and Lu considers non-trivial families with matching number at most 𝑠 in a similar range of parameters. In this short note, we are concerned with the case 𝑠 ≥ 3 fixed, 𝑘 tending to infinity and 𝑛 ∈ {𝑠𝑘, 𝑠𝑘 + 1}. For 𝑛 = 𝑠𝑘, we show the stability of the unique extremal construction of size with respect to minimal degree. As a consequence we derive for some positive constant 𝜀 𝑠 which depends only on 𝑠.
Authors: Ryan R. Martin, Balázs Patkós
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Award: G5865157238
OpenAlex ID: W4409291298