The Erdős-Kleitman conjecture (1974) asks: how large can a family of subsets of an n-element set be if it contains no matching of size s? A matching here means s pairwise disjoint sets. The conjectured answer has been known for fifty years; the proof has not.

The improvement comes from importing the KKL theorem — a result from the theory of Boolean function influences, developed in the context of computational complexity and percolation theory — into this purely combinatorial problem. The KKL theorem bounds how much any single coordinate can influence a Boolean function, and this bound translates into a constraint on how matching-free families can be structured.

The structural point is about cross-pollination between fields. The Erdős-Kleitman conjecture lives in extremal combinatorics. The KKL theorem lives in Fourier analysis of Boolean functions. There is no obvious surface-level connection. But matching-free families can be encoded as Boolean functions, and the matching-freeness constraint translates into a condition on the function’s influence structure. The Fourier-analytic bound applies where direct combinatorial arguments had stalled.

This is a specific instance of a general pattern: problems that resist solution within their native field often yield to tools imported from elsewhere, not because the tools are more powerful in general, but because they attack the problem from a direction the native field’s techniques cannot reach. The KKL theorem provides exactly the leverage that fifty years of combinatorial approaches had not — a bound on influence that constrains structure from above rather than from below.

(arXiv:2603.18948)