Erdős Matching Conjecture Overview

• Erdős Matching Conjecture is a fundamental problem in extremal set theory that bounds the size of k-uniform families with restricted matching numbers using two canonical constructions.
• Recent progress, culminating in Mishra’s full resolution, leverages shifting techniques and stability analyses to establish the extremal bounds for all n ≥ sk.
• Its methods, including the truncated (clique) and star-like (cover) constructions, have significant applications in hypergraph matching, finite geometry, and probabilistic combinatorics.

The Erdős Matching Conjecture (EMC) is a fundamental problem in extremal set theory and hypergraph theory, concerned with bounding the size of $k$-uniform set families and hypergraphs that avoid large matchings. It asserts that, for given $n,k,s$, the largest size of a $k$-uniform family of $k$-sets over an $n$-element ground set with matching number at most $s$ is attained by one of two canonical constructions. The conjecture has spawned a vast literature, with recent progress culminating in its full resolution.

1. Formal Statement and Extremal Constructions

Let $[n]=\{1,\ldots,n\}$. A $k$-uniform family (or $k$-graph) $\mathcal{F} \subset \binom{[n]}{k}$ is a collection of $k$-element subsets. The matching number $\nu(\mathcal{F})$ denotes the size of the largest collection of pairwise disjoint sets in $\mathcal{F}$. The Erdős Matching Conjecture states:

For all $n \ge sk$, $k \ge 1$, $s \ge 1$, every $k$-uniform family $\mathcal{F} \subset \binom{[n]}{k}$ with $\nu(\mathcal{F}) \le s-1$ satisfies

$$|\mathcal{F}| \le \max \left\{\binom{sk-1}{k},\ \binom{n}{k}-\binom{n-s+1}{k} \right\}.$$

The two canonical extremal families are:

• Truncated Family (Clique Construction): All $k$-sets from a fixed ground set of $sk-1$ elements: $\mathcal{G}^* = \binom{[sk-1]}{k}$ (matching number $s-1$).
• Star-like Family (Cover Construction): All $k$-sets that intersect a fixed $(s-1)$-element set $S \subset [n]$: $$\mathcal{F}^* = \{F \subset [n]: |F|=k, F \cap S \ne \emptyset\}$$ (matching number $s-1$).

Both constructions saturate the bound, and for $n > (s+1)k-1$, the star-like family yields the extremal size.

2. Historical Progress and Resolution

Erdős originally posed this problem in 1965. Early results affirmed EMC for $k=2$ (Erdős–Gallai theorem) and for $k=3$ asymptotically. Kleitman solved the $n=sk$ case, showing the truncated family is unique. In larger $n$, significant advances were due to work by Frankl and Kupavskii, who improved the $n$ threshold for which EMC could be proved, ultimately reducing it to nearly twice the conjectured minimum $n$.

The full conjecture was recently resolved by Mishra (Mishra, 1 Feb 2026), who established the upper bound for all $n \ge sk$ and arbitrary $k, s$. The proof leverages a stabilization process using shifting operations and potential functions, iteratively modifying the family to one of the two extremal forms without increasing its size or matching number.

For the case $k=3$, the conjecture was confirmed by Frankl (Luczak et al., 2012) for all sufficiently large $n$, using a combination of the shifting technique, stability analysis, and intricate counting of multipartite contributions. For $k > 3$, the recent global solution applies.

3. Methods, Stability, and Structure Theorems

A central technique in EMC proofs is shifting, an operation on set families pushing the sets toward lex-order minimality while preserving the matching number and size. The stabilization via shifts produces families that are highly structured, facilitating combinatorial or probabilistic arguments.

Stability versions, especially those of Hilton–Milner type, show that if a family achieves (or nearly achieves) the extremal size, then it must be isomorphic to one of the canonical constructions (Frankl et al., 2016, Martin et al., 2024). For large $n$, families with maximum matching number and minimal degree close to the unique extremal have strictly smaller size unless they match the trivial structure exactly.

For certain ranges, a third, Hilton–Milner–type construction arises as the unique runner-up when the covering number exceeds the matching number, characterizing all almost-extremal families (Frankl et al., 2016).

4. Extensions, Variants, and Degree-Threshold Results

Variants and Generalizations

• $t$-matching number: The extremal problem generalizes to families avoiding certain intersections (i.e., requiring $|A_i \cap A_j| < t$), leading to an analogue of EMC where the extremal structures are unions of $t$-stars (zhang et al., 18 Aug 2025, Pelekis et al., 2017).
• General $U(s,q)$-Property: Families where the union of any $s$ sets has size at most $q$ unify EMC with intersection theorems; explicit extremal families and thresholds are known for large $n$ (Frankl et al., 2019).
• $q$-analogs: Similar conjectures in finite vector spaces (subspace settings) identify extremal families as unions of "dictator" classes. For $s$ bounded relative to $q$ and $n$, optimality is achieved by the union of $s$ dictator classes (Ihringer, 2020).

Degree Thresholds

• Minimum Vertex Degree: Lower bounds on vertex degree imply large or perfect matchings in $k$-graphs. Recent improvements lower the $n$ threshold and identify sharp thresholds for perfect matchings in hypergraphs, using fractional matching, random sparsification, and stability techniques (Guo et al., 2020, Han, 2015).
• Perfect and Almost Perfect Matchings: New upper bounds for $d$-degree thresholds for perfect matchings follow from EMC-type results, and are exact for a wide range of parameters ($d$ close to $k/2$) (Han, 2015).

5. Probabilistic and Random Hypergraph Analogues

The EMC has natural interpretations in the theory of Kneser hypergraphs. The independence number of the $r$-uniform Kneser hypergraph $\mathrm{KG}^r_{n,k}$ is precisely the extremal function considered by EMC. A random version, where each edge is selected independently with probability $p$, exhibits a sharp threshold: when $p$ exceeds a critical value, the random hypergraph a.s. inherits the EMC extremal property, and maximum independent sets remain unions of stars (Alishahi et al., 2018).

This line of work connects EMC to probabilistic combinatorics, concentration inequalities, and anti-Ramsey theory.

6. Impact, Applications, and Open Directions

The resolution and partial results on the EMC have profound implications in extremal combinatorics, theoretical computer science (e.g., Dirac-type conditions, property testing), and finite geometry (Cameron–Liebler line classes). The methods developed—shifting, cross-dependent families, random chain analysis, and spectral techniques—are foundational in adjacent areas.

Open directions include:

• Precise stability and diversity theorems for near-extremal families (especially at the precise thresholds $n = sk + t$ for small $t$).
• Exact degree-thresholds for perfect matchings in all parameter ranges.
• Analysis of random versions near and within the critical window.
• Extension of $t$-matching and $U(s,q)$-bounds beyond the currently accessible ranges.
• Further exploration of $q$-analogs in vector spaces and related geometries.

7. Table: Key Milestones in EMC

Result or Parameter Regime	Reference	Key Contribution
$k=2$ (graphs)	Erdős–Gallai	Exact solution
$n=sk$	Kleitman	Uniqueness, truncated family extremal
Large $n, k, s$ fixed	Frankl, Kupavskii	EMC holds for $n \ge (2s+1)k-s$ etc.
$k=3$, all large $n$	Frankl	EMC resolved (Luczak et al., 2012)
Almost-perfect matchings	Kolupaev–Kupavskii	Extremal window broadened (Kolupaev et al., 2022)
Full solution, all $n \ge sk$	Mishra	Conjecture resolved (Mishra, 1 Feb 2026)
$t$-matching and $U(s,q)$ cases	Kupavskii, Frankl	Generalized extremal structures (zhang et al., 18 Aug 2025, Frankl et al., 2019)

The EMC stands as a central result illuminating deep combinatorial dichotomies—between clique-like and covering-like extremal structures—and underpins much of the ongoing research in extremal set theory and hypergraph matching theory.