Pith. sign in

REVIEW 4 minor 2 cited by

A Spectral Confirmation of the Erd\H{o}s Matching Conjecture

T0 review · 0 major / 4 minor · reviewed 2026-07-10 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For large n, every r-uniform hypergraph with matching number less than s has spectral radius at most that of the star family F_{s-1}(n), with equality only for that family.

desk verdict Solid spectral confirmation of the Erdős Matching Conjecture for large n, with clean uniqueness and a spectral EKR corollary; the argument is transparent and the soft spots are conventional rather than load-bearing. read the letter →

arxiv 2607.07392 v1 pith:TMNME7N6 submitted 2026-07-08 math.CO

Liying Kang , Yongchun Lu , Xiying Yuan , Junpeng Zhou This is my paper · ORCID
classification math.CO MSC 05C5005C65
keywords hypergraphspectralradiusErdősMatchingConjectureshiftingadjacencytensornumberErdős–Ko–Rado
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The classical Erdős Matching Conjecture asks for the largest number of edges an r-uniform hypergraph can have if it contains no matching of size s. This paper proves a spectral version of the same statement: among all such hypergraphs on n vertices, the largest possible spectral radius of the adjacency tensor is achieved uniquely by the family F_{s-1}(n) of all edges that meet a fixed set of s-1 vertices, once n is large enough. The argument first reduces to shifted hypergraphs by the classical shifting operation (which never increases matching number and never decreases spectral radius), then uses tensor variational bounds and structural analysis of edge-maximal shifted examples to force the extremal graph to be exactly F_{s-1}(n). Removing the shifted hypothesis via a known lifting lemma yields the general result, and the intersecting case s=2 recovers a spectral form of the Erdős–Ko–Rado theorem.

What carries the argument

The shifting operation that produces a shifted hypergraph without raising the matching number or lowering the spectral radius, combined with a structural analysis of shifted-saturated hypergraphs that forces any spectral maximizer to contain successively larger star families until it equals F_{s-1}(n).

What would settle it

Exhibit a single n-vertex r-uniform hypergraph H with ν(H)<s, n larger than any fixed function of r and s, such that either ρ(H)>ρ(F_{s-1}(n)) or ρ(H)=ρ(F_{s-1}(n)) while H is not isomorphic to F_{s-1}(n).

Watch

Extended reading notes

Core claim

For every fixed r,s≥2 and all sufficiently large n, any n-vertex r-uniform hypergraph H with matching number ν(H)<s satisfies ρ(H)≤ρ(F_{s-1}(n)), with equality if and only if H is isomorphic to F_{s-1}(n). Here F_a(n) is the family of all r-subsets that intersect a fixed a-set.

Load-bearing premise

The argument relies on an external combinatorial fact that any hypergraph which becomes exactly F_{s-1}(n) after one shift but is not already isomorphic to it must already contain a matching of size s; without that black-box lifting step the uniqueness claim for non-shifted graphs fails.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper establishes a spectral analogue of the Erdős Matching Conjecture: for fixed r,s≥2 and all sufficiently large n, every n-vertex r-uniform hypergraph H with matching number ν(H)<s satisfies ρ(H)≤ρ(F_{s-1}(n)), with equality if and only if H is isomorphic to F_{s-1}(n). The argument proceeds by shifting (which preserves ν(H)<s and does not decrease spectral radius), asymptotic spectral estimates for the families F_a(n) and for unions with O(n^{r-2}) edges, structural forcing lemmas that force any shifted-saturated maximizer to equal F_{s-1}(n), and a final non-isomorphism lift (Lemma 3.6, cited from Wang–Peng) that recovers uniqueness for general (non-shifted) hypergraphs. A spectral Erdős–Ko–Rado corollary for intersecting families is obtained as an immediate special case.

Significance. The result supplies a clean spectral confirmation of the classical matching conjecture in the large-n regime and simultaneously yields a spectral EKR theorem. The proof chain is transparent: variational characterization of the tensor spectral radius, shifting, hypergraph decomposition, and combinatorial saturation arguments are combined in a standard and reproducible way. The only external black-box is an independent combinatorial fact used solely for uniqueness of the non-shifted extremal; the inequality direction itself is self-contained. The asymptotic nature of the threshold is conventional for spectral Turán-type theorems and does not diminish the contribution.

minor comments (4)
  1. The quantitative threshold “sufficiently large n” is never made explicit; while conventional, a brief remark on the dependence on r and s (arising from the O-terms in Lemmas 2.5–2.6) would improve readability.
  2. Lemma 3.6 is cited from a 2026 preprint (Wang–Peng). A one-sentence sketch of its short combinatorial argument, or an explicit pointer to the relevant statement, would make the uniqueness step self-contained for readers who do not have that preprint at hand.
  3. In the proof of Lemma 2.5 the error term after (2.3) is written O(n^{(r-1)^2/r-1}); a uniform notation for the secondary terms throughout Lemmas 2.5–2.6 would avoid minor notational inconsistency.
  4. Typographical: the abstract and title use both “Erdős” and “Erd˘os”; standardize the diacritic. Also, “sett:=s-a” in Lemma 3.1 should be spaced as “set t:=s-a”.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the spectral extremal bound is derived from first-principles variational estimates, shifting, and structural lemmas without self-referential definitions or fitted parameters.

full rationale

The paper establishes Theorem 1.6 by a transparent chain that does not reduce to its own inputs. Spectral radius is characterized variationally (Lemma 1.3) and bounded via Hölder/Maclaurin inequalities and hypergraph decomposition (Lemmas 2.3–2.6), all parameter-free. Shifting (Lemmas 2.1–2.2) preserves the matching-number constraint while non-decreasing ρ, reducing to the shifted-saturated case. Structural lemmas (3.1–3.4) then force any maximizer to equal F_{s-1}(n) by explicit matching constructions and asymptotic comparison of leading coefficients c_{a,r}. The final uniqueness lift for non-shifted graphs (Lemma 3.6) is an independent external combinatorial statement, not a self-citation of the spectral claim. No fitted quantities, self-definitional loops, or ansatz smuggling appear; the “sufficiently large n” threshold is the conventional asymptotic remainder from the spectral expansions and does not create circularity.

Assumptions & free parameters 0 free parameters · 4 assumptions · 2 invented entities

The paper works entirely inside standard extremal combinatorics and tensor spectral theory. No free parameters are fitted; the only non-standard ingredients are classical combinatorial operations (shifting) and one external non-isomorphism lemma. Invented entities are merely convenient names for well-known constructions.

assumptions (4)
  • standard math Shifting does not increase matching number (Frankl 1987) and does not decrease spectral radius (proved in Lemma 2.2).
    Used throughout Section 2.1 and the reduction in the proof of Theorem 1.6.
  • standard math Variational characterization of the spectral radius of a nonnegative symmetric tensor (Qi 2013).
    Lemma 1.3; foundation for all spectral comparisons.
  • standard math Perron–Frobenius theorem for weakly irreducible nonnegative tensors (Friedland–Gaubert–Han, Yang–Yang).
    Theorem 1.4; guarantees uniqueness of the positive eigenvector used in asymptotic estimates.
  • domain assumption Lemma 3.6 (Wang–Peng 2026): if S_ij(H)=F_{s-1}(n) but H is not isomorphic to F_{s-1}(n), then ν(H)≥s (for n≥2r+s−2).
    Black-box lifting step that removes the shifted hypothesis at the end of the proof of Theorem 1.6.
invented entities (2)
  • F_a(n) independent evidence
    purpose: Canonical extremal family consisting of all r-subsets that intersect a fixed a-set; the claimed unique maximizer when a=s−1.
    Standard construction already present in the classical Erdős Matching Conjecture literature; merely named for convenience.
  • shifted-saturated hypergraph
    purpose: Edge-maximal shifted hypergraph with matching number <s; intermediate object used to force containment of F_{s−1}(n).
    Technical device internal to the proof; no independent physical or combinatorial existence claim beyond the paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Spectral Confirmation of the Erd\H{o}s Matching Conjecture." pith.science (2026). https://pith.science/paper/TMNME7N6

@misc{pith2026260707392,
  author       = {Pith},
  title        = {Pith review of: A Spectral Confirmation of the Erd\Hos Matching Conjecture},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TMNME7N6}},
  note         = {Machine review of arXiv:2607.07392}
}
abstract

The Erd\H{o}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 $\nu(H)<s$, the inequality $\rho(H)\leq \rho(\mathcal{F}_{s-1}(n))$ holds whenever $n$ is sufficiently large. Here $\mathcal{F}_{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\H{o}s-Ko-Rado theorem for intersecting hypergraph families.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Spectral Hilton--Milner--Frankl Theorem for $t$-Intersecting Families

    math.CO 2026-08 accept novelty 7.0 of 10

    For large enough ground sets, every nontrivial t-intersecting k-uniform family has adjacency-tensor spectral radius bounded by the larger of two explicit extremal families, with equality only for copies of those families.

  2. Tensor Spectral Stability for Uniform Hypergraphs with Bounded Matching Number

    math.CO 2026-07 accept novelty 6.0 of 10

    Near-maximal tensor spectral radius forces a k-graph with matching number ≤β to be structurally close to S_{n,k,β} for large n.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages · cited by 2 Pith papers

  1. [1]

    Bollob´ as, D

    B. Bollob´ as, D. Daykin, P. Erd˝ os, Sets of independent edges of a hypergraph,Quarterly Journal of Math- ematics: Oxford Series (2),27(105) (1976) 25–32

    work page 1976

  2. [2]

    Cooper, A

    J. Cooper, A. Dutle, Spectra of uniform hypergraphs,Linear Algebra Appl.436(9) (2012) 3268–3292

    work page 2012

  3. [3]

    Erd˝ os, A problem on independentr-tuples,Ann

    P. Erd˝ os, A problem on independentr-tuples,Ann. Univ. Sci. Budapest,8(1965) 93–95

    work page 1965

  4. [4]

    Erd˝ os, T

    P. Erd˝ os, T. Gallai, On maximal paths and circuits of graphs,Acta Math. Acad. Sci. Hung.10(1959) 337–356

    work page 1959

  5. [5]

    Erd˝ os, C

    P. Erd˝ os, C. Ko, R. Rado, Intersection theorems for systems of finite sets,Quart. J. Math. Oxford Ser. 12(2) (1961) 313–320

    work page 1961

  6. [6]

    Frankl, The shifting technique in extremal set theory,Surv

    P. Frankl, The shifting technique in extremal set theory,Surv. Combin.123(1987) 81–110

    work page 1987

  7. [7]

    Frankl, Improved bounds for Erd˝ os’ matching conjecture,J

    P. Frankl, Improved bounds for Erd˝ os’ matching conjecture,J. Combin. Theory Ser. A120(2013) 1068– 1072. 10

    work page 2013

  8. [8]

    Frankl, On the maximum number of edges in a hypergraph with a given matching number,Discrete Appl

    P. Frankl, On the maximum number of edges in a hypergraph with a given matching number,Discrete Appl. Math.216(2017) 562–581

    work page 2017

Show all 24 references
  1. [9]

    Frankl, Proof of the Erd˝ os Matching Conjecture in a new range,Israel J

    P. Frankl, Proof of the Erd˝ os Matching Conjecture in a new range,Israel J. Math.222(1) (2017) 421–430

    2017

  2. [10]

    Frankl, A

    P. Frankl, A. Kupavskii, The Erd˝ os matching conjecture and concentration inequalities,J. Combin. Theory Ser. B157(2022) 366–400

    2022

  3. [11]

    Frankl, T

    P. Frankl, T. Luczak, K. Mieczkowska, On matchings in hypergraphs,Electron. J. Combin.19(2) (2012) P42

    2012

  4. [12]

    Friedland, S

    S. Friedland, S. Gaubert, L. Han, Perron-Frobenius theorem for nonnegative multilinear forms and exten- sions,Linear Algebra Appl.438(2013) 738–749

    2013

  5. [13]

    J. Hou, C. Hu, X. Liu, A finite-board reduction for the Erd˝ os Matching Conjecture and the 4-uniform case via exact certificates,arXiv preprint, arXiv:2605.26060, 2026

    2026 arXiv

  6. [14]

    Huang, P

    H. Huang, P. Loh, B. Sudakov, The size of a hypergraph and its matching number,Combin. Probab. Comput.21(03) (2012) 442–450

    2012

  7. [15]

    Kolupaev, A

    D. Kolupaev, A. Kupavskii, Erd˝ os’ Matching Conjecture for almost perfect matchings,Discrete Math.346 (2023) 113304

    2023

  8. [16]

    Kupavskii, G

    A. Kupavskii, G. Sokolov, A complete solution of the Erd˝ os-Kleitman matching problem forn≤3s,arXiv preprint, arXiv:2511.21628, 2025

    2025

  9. [17]

    L. Lim, Singular values and eigenvalues of tensors: a variational approach, in:Proceedings of the IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP’05), 1(2005) 129–132

    2005

  10. [18]

    Luczak, K

    T. Luczak, K. Mieczkowska, On Erd˝ os’ extremal problem on matchings in hypergraphs,J. Combin. Theory Ser. A124(2014) 178–194

    2014

  11. [19]

    Nikiforov, Analytic methods for uniform hypergraphs,Linear Algebra Appl.457(2014) 455–535

    V. Nikiforov, Analytic methods for uniform hypergraphs,Linear Algebra Appl.457(2014) 455–535

    2014

  12. [20]

    Qi, Eigenvalues of a real supersymmetric tensor,J

    L. Qi, Eigenvalues of a real supersymmetric tensor,J. Symbolic Comput.40(6) (2005) 1302–1324

    2005

  13. [21]

    Qi, Symmetric nonnegative tensors and copositive tensors,Linear Algebra Appl.439(2013) 228–238

    L. Qi, Symmetric nonnegative tensors and copositive tensors,Linear Algebra Appl.439(2013) 228–238

    2013

  14. [22]

    Shao, A general product of tensors with applications,Linear Algebra Appl.439(2013) 2350–2366

    J. Shao, A general product of tensors with applications,Linear Algebra Appl.439(2013) 2350–2366

    2013

  15. [23]

    W. Wang, Y. Peng, Counting the maximum number of sunflowers in hypergraphs with given matching number,European J. Combin.136(2026) 104379

    2026

  16. [24]

    Y. Yang, Q. Yang, Further results for Perron-Frobenius theorem for nonnegative tensors,SIAM J. Matrix Anal. Appl.31(5) (2010) 2517–2530. 11

    2010

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.