Erdős-Ko-Rado Theorems in Combinatorial Structures

The Erdős–Ko–Rado (EKR) theorem is a cornerstone of extremal set theory, originally characterising the maximum size of a family of k-element subsets of an n-element set in which every pair of subsets intersects. Its elegant simplicity has inspired a vast programme of generalisations to diverse combinatorial structures. Extensions to permutation groups replace subsets with collections of permutations that agree on designated points, yielding sharp bounds on intersecting families under the action of symmetric and linear groups. In graph theory, analogous results determine the largest independent sets in Kneser and Johnson graphs, while vector-space versions quantify intersecting families of subspaces over finite fields. Recent work has unified these perspectives via algebraic and spectral methods, employing eigenvalue bounds, representation theory and isoperimetric inequalities to reveal common underlying principles. These advances have deepened our understanding of symmetry, intersection density and stability and have found applications in coding theory, network design and statistical physics.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Research from all publishers

Building on the classical theorem for subsets, foundational work in the Journal of the American Mathematical Society established the precise structure of maximum k-intersecting families of permutations. It demonstrated that for sufficiently large degree n, any maximal collection of permutations that pairwise agree on at least k points must be a coset of a stabiliser subgroup, settling a longstanding conjecture and showcasing the power of eigenvalue techniques and symmetric‐group representations. More recently, investigation into direct and wreath products of permutation groups has revealed how intersecting sets behave under group­-product constructions. By analysing derangement graphs defined via Cayley graphs on fixed‐point‐free elements, researchers proved that many composite groups inherit the strict EKR property, ensuring that all maximum intersecting families arise from point stabilisers. In parallel, studies of Kneser graphs of small uniformity have determined their intersection density in settings where the automorphism group contains classical linear groups. These results exploit group actions on vertex-transitive graphs and refine spectral bounds to compute exact densities, illuminating the interplay between group symmetry and combinatorial extremal configurations.

Erdős-Ko-Rado Theorems in Combinatorial Structures publication trend

The graph below shows the total number of articles in erdős-ko-rado theorems in combinatorial structures across all publications each year (not limited to Nature Index journals).

Technical terms

Intersecting family: A collection of combinatorial objects (such as subsets or permutations) in which every pair shares a common feature or fixed point.

Derangement graph: A Cayley graph on a permutation group whose vertices are group elements and whose edges connect pairs differing by a fixed-point-free permutation (a derangement).

Kneser graph: A graph whose vertices represent k-element subsets of an n-element set, with edges between disjoint subsets.

Point stabiliser: The subgroup of a permutation group that fixes a given element of the underlying set.

Eigenvalue bound: An inequality derived from the spectrum of a graph or adjacency operator, used to bound the size of independent or intersecting sets.

References

1. Intersecting families of permutations. Journal of the American Mathematical Society (2011).
2. On maximum intersecting sets in direct and wreath product of groups. European Journal of Combinatorics (2022).
3. On the intersection density of the Kneser graph K ( n , 3 ). European Journal of Combinatorics (2024).