A Spectral Confirmation of the Erdős Matching Conjecture

Published 8 Jul 2026 in math.CO | (2607.07392v1)

Abstract: The Erdős Matching Conjecture concerns the maximum number of hyperedges in an $r$ -uniform hypergraph with bounded matching number. In this paper, we study a spectral counterpart of this conjecture. For sufficiently large $n$ , we determine the maximum spectral radius over all $n$ -vertex $r$ -uniform hypergraphs whose matching number is less than $s$ , and characterize the unique extremal hypergraph. To establish the main theorem, we first apply the shifting method to reduce the problem to shifted hypergraphs. We then derive several spectral upper bounds through hypergraph decomposition and related variational estimates for tensor spectral radii. With these estimates, we analyze the structural properties of shifted-saturated hypergraphs and prove the spectral extremal theorem for shifted hypergraphs with bounded matching numbers. Finally, we drop the shifted condition and extend our spectral bound to general $r$ -uniform hypergraphs. Our main theorem states that for any $n$ -vertex $r$ -uniform hypergraph $H$ with matching number $ν(H)<s$, the inequality $ρ(H)\leq ρ(\mathcal{F}<em>{s-1}(n))$ holds whenever $n$ is sufficiently large. Here $\mathcal{F}</em>{a}(n)$ denotes the family of all $r$ -subsets of $[n]$ intersecting the vertex set $[a]$ , and equality is attained if and only if $H$ is isomorphic to $\mathcal{F}_{s-1}(n)$ . As an immediate corollary, we derive a spectral counterpart of the classical Erdős-Ko-Rado theorem for intersecting hypergraph families.

Abstract PDF Upgrade to Chat

Authors (4)

Summary

The paper establishes that any n-vertex r-uniform hypergraph with matching number less than s has its spectral radius bounded by that of the intersecting family F₍ₛ₋₁₎(n), with equality if and only if the hypergraph is isomorphic to it.
It employs shifting techniques and tensor eigenvalue methods to derive tight asymptotic spectral bounds, providing explicit formulas and control in both dense and sparse regimes.
The research bridges classical extremal combinatorics and spectral theory, yielding actionable insights for hypergraph design and applications in network design and combinatorial optimization.

Spectral Bounds and Extremal Structure in Hypergraphs: A Confirmation of the Erdős Matching Conjecture

Overview and Motivation

The paper "A Spectral Confirmation of the Erdős Matching Conjecture" (2607.07392) addresses the spectral analog of the classical Erdős Matching Conjecture in extremal combinatorics. The central focus is on $r$ -uniform hypergraphs with constrained matching number, aiming to determine the maximal spectral radius achievable under such constraints and to characterize the structure of extremal hypergraphs attaining this bound.

While the Erdős Matching Conjecture classically concerns the maximum edge count in an $r$ -graph given a matching bound, this work translates the question into the spectral domain. Specifically, it asks: given an $n$ -vertex $r$ -uniform hypergraph with matching number less than $s$ , what is the largest possible spectral radius of its adjacency tensor, and what structure realizes this extremality?

Main Theorem and Technique

Statement

For sufficiently large $n$ , the paper proves that any $n$ -vertex $r$ -uniform hypergraph $H$ with matching number $\nu(H) < s$ satisfies

$r$ 0

where $r$ 1 is the family of all $r$ 2-subsets of $r$ 3 intersecting $r$ 4, and $r$ 5 denotes the spectral radius of the adjacency tensor. Furthermore, equality holds if and only if $r$ 6, confirming that the extremal spectral radius is uniquely attained by this intersecting family.

Proof Methodology

The argument proceeds in several stages:

Shifting Reduction: The method-of-shifting, following Frankl, is used to reduce arbitrary hypergraphs to shifted (or stable) hypergraphs, leveraging properties that shifting maintains matching number and does not decrease spectral radius.
Spectral Bounds via Tensor Analysis: Key variational characterizations of tensor spectral radius and inequalities (notably Lemma \ref{lem:small-edge-spectral-bound}) are used to bound the spectral radius in terms of hyperedge count and structural parameters.
Structure Analysis of Shifted Hypergraphs: The proofs establish inductive properties of shifted-saturated hypergraphs, showing that the process of saturation (by repeated application of the inclusion-maximal property) leads uniquely to $r$ 7.
Characterization of Extremality: By leveraging the Perron-Frobenius theory for tensors and automorphism-invariance arguments, the uniqueness of the extremal hypergraph is rigorously confirmed.

Numerical Results and Explicit Bounds

The authors provide asymptotic formulas for the spectral radius of $r$ 8:

$r$ 9

where $n$ 0 is an explicit constant depending on $n$ 1 and $n$ 2, and the error term is detailed. These bounds validate the claims on extremality and differentiate sharply between families with varying intersection parameters.

Additionally, it is established that for $n$ 3-graphs with very small edge count $n$ 4, one has:

$n$ 5

providing spectral control in sparse regimes.

Spectral Erdős-Ko-Rado Theorem

An immediate corollary is a spectral analog of the classical Erdős-Ko-Rado theorem: for intersecting families $n$ 6 and large $n$ 7,

$n$ 8

with equality only for families isomorphic to $n$ 9. This bridges classical extremal combinatorics and spectral hypergraph theory, demonstrating maximal spectral radius aligns with maximal intersecting families.

Implications and Future Directions

Practical Implications

Spectral Optimization in Hypergraph Design: The results prescribe the optimal hypergraph structure for maximizing spectral radius under matching constraints, with applications in network design, coding theory, and combinatorial optimization.
Spectral Bounds in Sparse Regimes: Precise spectral bounds for sparse hypergraphs inform both spectral gap estimates and potential for expansion in hypergraph-based constructions.

Theoretical Implications

Uniqueness of Extremal Structure: The characterization shows that the extremal spectral radius is uniquely obtained by intersecting families $r$ 0. This adds weight to the stability philosophy in extremal combinatorics: extremality and near-extremality correspond to highly structured configurations.
Tensor Spectral Theory in Extremal Combinatorics: The fusion of tensor eigenvalue theory and shifting techniques opens avenues for tackling open problems in spectral extremal hypergraph theory.

Speculations for AI and Discrete Mathematics

Future developments in AI-driven combinatorial optimization may leverage these spectral extremal results to guide generation and evaluation of hypergraph-based architectures, especially in domains where spectral properties correlate with robustness or computational efficiency. Furthermore, deeper integration of spectral tensor theory with extremal combinatorial methods is likely to yield new bounds for more general forbidden subgraph problems.

Conclusion

This work provides a rigorous spectral confirmation of the Erdős Matching Conjecture for sufficiently large hypergraphs, interlinking shifting techniques and tensor spectral analysis to identify and characterize the unique extremal structure. The derived spectral bounds and structural insights stand as significant contributions to both spectral hypergraph theory and extremal combinatorics, while setting the stage for further advances in applied and theoretical research on hypergraph spectra.

Markdown Report Issue