Pith. sign in

REVIEW 2 major objections 4 minor 1 cited by

For k≥t+3 and n sufficiently large, every t-intersecting family of k-subsets with t-covering number at least t+2 has size at most the largest of three explicit binomial formulas, and equality forces one of three explicit structures.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · deepseek-v4-flash

2026-08-02 23:19 UTC pith:FWQQXGRR

load-bearing objection Solid next-step theorem in the EKR hierarchy: it settles the t-intersecting covering-number t+2 problem for k ≥ t+3 with full equality structure, and the reader's main worry is not the flagged WLOG but the imported keystone lemma. the 2 major comments →

arxiv 2602.14129 v3 pith:FWQQXGRR submitted 2026-02-15 math.CO

Extremal t-intersecting families for finite sets with t-covering number at least t+2

Tian Yao , Dehai Liu , Kaishun Wang This is my paper
classification math.CO MSC 05D05
keywords t-intersecting familiest-covering numberextremal set theoryminimum t-coversfinite setsintersection theorems for set systems
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper aims to settle, in the regime where the ground set is large and k≥t+3, the maximum size of a t-intersecting family of k-subsets whose t-covering number is at least t+2, and to identify all families that attain it. The answer is the maximum of three explicit binomial expressions, and the equality cases are three explicit families built from stars, a small exceptional set, and a fixed (t+4)-set. This is the first complete structural description in this covering-number range, and it unifies earlier answers for covering number 3 with t=1 and for k=t+2. The proof works by showing that the collection of minimum t-covers of an extremal family must itself have t-covering number t, t+1, or t+2; each case forces one of the three constructions. The result matters because covering number is the standard measure of how non-trivial an intersecting family is, so the theorem draws the exact boundary between trivial and genuinely complicated extremal examples.

Core claim

The central claim is a classification. Let F be a t-intersecting family of k-element subsets of an n-element set with τ_t(F)≥t+2; if k≥t+3 and n≥(t+3 choose 2)(k−t+1)^4, then |F|≤max{f1,f2,f3}, where f1, f2, and f3 are the sizes of the families in Constructions 1, 2, and 3. Moreover, equality holds exactly when F is one of those constructed families. The three constructions are: a family whose members meet a fixed t-set T in all t points while avoiding a pair of disjoint blocks, together with three exceptional k-sets; a family built around a fixed (t+2)-set W inside a (k+2)-set M, with members intersecting W in at least t points in the prescribed way; and the family of all k-sets meeting a f

What carries the argument

The load-bearing object is T_t(F), the family of all minimum t-covers of F: subsets of [n] of size exactly τ_t(F) that meet every member of F in at least t elements. For an extremal F, τ_t(F)=t+2, so T_t(F) consists of (t+2)-sets. The proof imports a lemma that T_t(F) is itself t-intersecting when F is maximal and n≥2k; since a t-intersecting family of (t+2)-sets has t-covering number t, t+1, or t+2, this produces the trichotomy that organizes the argument. Each branch either bounds |T_t(F)| from above and below until only one construction survives, or identifies the exact shape of T_t(F). A separate counting lemma converts bounds on |T_t(F)| and on the number of members of F avoiding a give

Load-bearing premise

The proof hinges on the imported lemma that, for n≥2k, the minimum t-covers of a maximal t-intersecting family form a t-intersecting family themselves; if that fails, the three-way split that organizes the paper cannot begin.

What would settle it

Look for an actual family F of k-element subsets of an n-element set with τ_t(F)=t+2, k≥t+3, and n below the stated threshold whose size exceeds max{f1,f2,f3}; or, more directly, search for a maximal t-intersecting family with n≥2k whose minimum t-covers are not pairwise t-intersecting, which would invalidate the imported lemma and collapse the trichotomy. The second test is the more decisive one because it attacks the paper's load-bearing assumption rather than its numerical threshold.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

If this is right

  • The function f(n,k,t,t+2) is now determined: it is the maximum of the three explicit binomial expressions f1(n,k,t), f2(n,k,t), and f3(n,k,t).
  • Any maximum family in this range must appear in one of Constructions 1–3, so the extremal structure is completely classified, not merely bounded.
  • As t=1, the theorem covers k≥4 with t-covering number at least 3, placing the classical covering-number-three problem into a single uniform statement.
  • Each of the three constructions is needed: the paper exhibits parameter pairs for which the maximum is attained by Construction 1, by Construction 2, and by Construction 3, respectively.
  • An extremal family must contain at least max{(k−t)(k−t+1)+1, (t+2)(k−t)+1, binomial(t+4,2)} minimum t-covers, giving a quantitative certificate for extremality.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper: the stated threshold n≥(t+3 choose 2)(k−t+1)^4 is almost certainly an artifact of the proof; it would be worth testing whether the same three constructions remain extremal for much smaller n, and where the true threshold lies.
  • Beyond the paper: the trichotomy suggests that iterating the cover-family operator T_t—considering the t-covering number of T_t(F), then of T_t(T_t(F)), and so on—may produce a natural hierarchy of extremal constructions as the prescribed covering number grows past t+2.
  • Beyond the paper: the same cover-family trichotomy could plausibly transfer to other combinatorial settings that have a notion of covering number, such as families of subspaces of a finite vector space or of blocks in a design.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 4 minor

Summary. The paper determines the maximum size and the extremal structure of t-intersecting k-uniform families on [n] whose t-covering number is at least t+2, for k≥t+3 and n at least C(t+3,2)(k−t+1)^4. Three explicit constructions are proposed with sizes f1, f2, f3, and Theorem 1.1 asserts that every extremal family is one of these. The proof reduces to maximal t-intersecting families, uses Lemma 2.1 to infer that the family T_t(F) of minimum t-covers is itself t-intersecting, and then analyzes the three cases τ_t(T_t(F))=t, t+1, t+2. Section 3 supplies a general upper bound and asymptotic comparisons. The result generalizes Frankl's theorems for t=1 with covering number 3 and for k=t+2.

Significance. If the proof is completed, this is a natural and nontrivial extension of Frankl's results, with a full equality characterization. The constructions and their counting formulas are clear, and the internal count checks in Section 2 (for example the Pascal-type identities and the C(t+2,2) term in Construction 2) are consistent. The paper uses a modern cross-intersecting family bound and gives a quantitative, falsifiable statement. However, the proof rests on one imported keystone lemma and contains a local but load-bearing reversed inequality in the final numerical comparison, so the manuscript needs revision before the claims are fully established.

major comments (2)
  1. [Section 2, Lemma 2.1] Lemma 2.1 is the keystone of the whole proof: it is the sole reason the paper can assert τ_t(T_t(F))∈{t,t+1,t+2}, and without it Propositions 2.2, 2.4, 2.10 and the final trichotomy in the proof of Theorem 1.1 have no foundation. The lemma is imported from [4] and is not proved or even stated in a self-contained way. I found no internal inconsistency in its use, but as submitted the main theorem is conditional on an external result that is not verified in the manuscript. The authors should either supply a proof of Lemma 2.1 or give a precise self-contained statement with a reference that the referee can check directly.
  2. [Section 3, proof of Theorem 1.1] The monotonicity argument for g contains a reversed inequality. For x∈{t+3,...,k−1}, we have n−x≤n−t−3, so replacing n−x by n−t−3 gives a lower bound, not an upper bound. Thus the displayed chain g(x+1)/g(x) = ... ≤ (t+4)(k−t+1)(k−t−3)/(4(n−t−3)) is not justified; the correct inequality is ≥. Consequently the conclusion g(x+1)<g(x), which is used to exclude τ_t(F)≥t+3, is not established as written. The step appears repairable: since x≤k−1, one has n−x≥n−k+1, and the stated threshold n≥C(t+3,2)(k−t+1)^4 is sufficient to make the corrected upper bound smaller than 1. The displayed inequality should be corrected and the threshold re-verified.
minor comments (4)
  1. [Constructions 1–3] The claimed properties of the three constructions — maximality, τ_t=t+2, and the stated counting formulas — are asserted but not proved. For a paper whose main theorem rests on these examples, a short verification of these properties would improve readability and completeness.
  2. [Construction 3 / f3] For k=t+3, the last binomial coefficient in f3 has negative lower entry k−t−4=−1. The authors should state the convention C(a,b)=0 for b<0, or write the sum over the relevant range.
  3. [Lemma 2.6 / Theorem 2.5] In Lemma 2.6, Theorem 2.5 is applied to J(A), J(B), J(C), which are families of 2-subsets of F\U, not k-subsets of [n]. The application is valid with n'=k−t+2 and k'=2, but this substitution should be stated explicitly, since the bound 3(k−t+1) is used later in Proposition 2.4.
  4. [Proposition 2.2, Case 1.1] The assertion 'we may assume Γ(G3)≠(G1∩G2)\T' is correct but not justified in the text. A parenthetical explanation that the argument is symmetric in G1, G2, G3 and that ∩_{G∈G} Γ(G)=∅ ensures such a choice would make the proof easier to follow.

Circularity Check

0 steps flagged

No significant circularity: the extremal bound is derived, and imported lemmas are general external results.

full rationale

Walking the derivation chain, Theorem 1.1 is not assumed at any point. The proof starts from a maximum-size family with τ_t(F) ≥ t+2, obtains a lower bound from the three explicit constructions, and then derives upper bounds via Lemma 3.2 and the trichotomy supplied by Lemma 2.1. Lemma 2.1, imported from [4, Lemma 2.1], is a general statement about arbitrary maximal t-intersecting families with n ≥ 2k: it asserts that the family T_t(F) of minimum t-covers is itself t-intersecting. Its stated assumptions do not include the conclusion of Theorem 1.1, the bound f1/f2/f3, or the extremal constructions; it is therefore independent support even though [4] shares co-author K. Wang. The trichotomy τ_t(T_t(F)) ∈ {t, t+1, t+2} follows directly from Lemma 2.1, and the subsequent case analysis (Propositions 2.2, 2.4, 2.10 with Lemmas 2.3, 2.9, 2.11) proves structural conclusions from the equality cases rather than postulating the target bound. Lemma 3.1 from [4] is likewise a general compression-type estimate, not a disguised version of the extremal theorem. Proposition 2.10 invokes [10, Theorem 1.8], which is the previously established k = t+2 base case applied to the auxiliary family T_t(F) ⊆ C([n], t+2); this is a legitimate use of a known theorem, not a renaming of the present result. The WLOG in Proposition 2.2 Case 1.1 is a symmetry/relabeling argument after observing ∩ Γ(G) = ∅; it does not smuggle in the desired structure. No fitted parameter is renamed as a prediction, and no equation in Sections 2–3 is equivalent by construction to the claimed maximum. The only self-citation is the importation of two general lemmas from [4], and those lemmas do not contain Theorem 1.1 as an assumption. Finding: no significant circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 4 axioms · 0 invented entities

The central claim rests on four imported theorems, two of which (Lemmas 2.1 and 3.1) come from a paper sharing co-author K. Wang. These are peer-reviewed general results about t-intersecting families and cross-intersecting bounds, not restatements of the target theorem; the present paper's contribution is the case analysis, the three constructions, and the large-n comparison machinery, all derived from first principles within the proof. No free parameters are fitted to data — n, k, t are problem inputs and the threshold C(t+3,2)(k−t+1)^4 is derived, not chosen to match anything.

axioms (4)
  • domain assumption Lemma 2.1 [4]: for a maximal t-intersecting family F ⊆ C([n],k) with n ≥ 2k, the family T_t(F) of minimum t-covers is t-intersecting.
    Imported from Cao–Lu–Lv–Wang (2024). Load-bearing: it yields the trichotomy τ_t(T_t(F)) ∈ {t,t+1,t+2} that structures all of Section 2. Not proved here; [4] shares co-author K. Wang.
  • domain assumption Theorem 2.5 [21]: for r non-empty pairwise cross-intersecting k-uniform families, the sum of sizes is at most max{C(n,k)−C(n−k,k)+r−1, r·C(n−1,k−1)}, with equality structure when n > 2k.
    Imported from Shi–Frankl–Qian (2022). Used in Lemmas 2.6–2.8 and Lemma 2.9 to bound parts of T_t(F) when τ_t(T_t(F)) = t+1; independent of the present authors.
  • domain assumption [10, Theorem 1.8] (Frankl 2026): a t-intersecting family H ⊆ C([n],t+2) with τ_t(H) = t+2 has |H| ≤ C(t+4,2), with equality iff H = C(Z,t+2) for some |Z| = t+4 (t ≥ 2).
    Imported from Frankl. Used in Proposition 2.10 for the case τ_t(T_t(F)) = t+2; this is exactly the result being 'generalized', and the new content lies in the k ≥ t+3 range.
  • domain assumption Lemma 3.1 [4]: a compression-type bound |F_S| ≤ C(k−ℓ, t−ℓ)·|F_R| for an enlarged cover R of S.
    Imported from Cao–Lu–Lv–Wang; the engine behind Lemma 3.2's size bounds used to force τ_t(F) = t+2 and to bound the non-covering parts of F. Shares co-author K. Wang with the present paper.

pith-pipeline@v1.3.0-alltime-deepseek · 227 in / 30928 out tokens · 265526 ms · 2026-08-02T23:19:42.992970+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of Extremal $t$-intersecting families for finite sets with $t$-covering number at least $t+2$." pith.science (2026). https://pith.science/paper/FWQQXGRR

@misc{pith2026260214129,
  author       = {Pith},
  title        = {Pith review of: Extremal $t$-intersecting families for finite sets with $t$-covering number at least $t+2$},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FWQQXGRR}},
  note         = {Machine review of arXiv:2602.14129}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Let $\mathcal{F}\subseteq{[n]\choose k}$ be a $t$-intersecting family. Define the $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ as the minimum size of a subset $S$ of $[n]$ with $|S\cap F|\geqslant t$ for each $F\in\mathcal{F}$. In this paper, we characterize $\mathcal{F}$ for which $|\mathcal{F}|$ takes the maximum value under the condition that $\tau_t(\mathcal{F})\geqslant t+2$ and $n$ is sufficiently large, thereby generalizing two results by Frankl.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. On extremal cross $t$-intersecting families with $t$-covering number conditions

    math.CO 2026-05 unverdicted novelty 5.0

    The paper characterizes extremal cross t-intersecting families maximizing |F1| |F2| under tau_t(F1), tau_t(F2) >= t+1 and describes maximal t-intersecting families with tau_t = t+1.

Reference graph

Works this paper leans on

22 extracted references · cited by 1 Pith paper

  1. [1]

    Ahlswede and L.H

    R. Ahlswede and L.H. Khachatrian, The complete nontrivial-intersection theorem for systems of finite sets, J. Combin. Theory Ser. A 76 (1996) 121–138. 19

    1996

  2. [2]

    Ahlswede and L.H

    R. Ahlswede and L.H. Khachatrian, The complete intersection theorem for systems of finite sets, European J. Combin. 18 (1997) 125–136

    1997

  3. [3]

    Bickle, Intersecting families of 3-sets, Australas

    A. Bickle, Intersecting families of 3-sets, Australas. J. Combin. 93 (2025) 216-223

    2025

  4. [4]

    M. Cao, M. Lu, B. Lv and K. Wang, Nearly extremal non-trivial crosst-intersecting families andr-wiset-intersecting families, European J. Combin. 120 (2024) 103958

    2024

  5. [5]

    Erd˝ os, C

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

    1961

  6. [6]

    Erd˝ os and L

    P. Erd˝ os and L. Lov´ asz, Problems and results on 3-chromatic hypergraphs and some related questions, in: Infinite and Finite Sets, Proc. Colloq. Math. Soc. J´ anos Bolyai, Keszthely, Hungary, 1973, North-Holland, Amsterdam, 1974, pp. 609–627

    1973

  7. [7]

    Frankl, The Erd˝ os-Ko-Rado theorem is true forn=ckt, in: Combinatorics, vol

    P. Frankl, The Erd˝ os-Ko-Rado theorem is true forn=ckt, in: Combinatorics, vol. I, Proc. Fifth Hungarian Colloq., Keszthely, 1976, in: Colloq. Math. Soc. J´ anos Bolyai, vol. 18, North-Holland, 1978, pp. 365–375

    1976

  8. [8]

    Frankl, On intersecting families of finite sets, J

    P. Frankl, On intersecting families of finite sets, J. Combin. Theory Ser. A 24 (1978) 146–161

    1978

  9. [9]

    Frankl, On intersecting families of finite sets, Bull

    P. Frankl, On intersecting families of finite sets, Bull. Aust. Math. Soc. 21 (1980) 363– 372

    1980

  10. [10]

    Frankl, Critically intersecting hypergraphs, European J

    P. Frankl, Critically intersecting hypergraphs, European J. Combin. 132 (2026) 104296

    2026

  11. [11]

    Frankl and A

    P. Frankl and A. Kupavskii, Uniform intersecting families with large covering number, European J. Combin. 113 (2023) 103747

    2023

  12. [12]

    Frankl, K

    P. Frankl, K. Ota and N. Tokushige, Uniform intersecting families with covering number four, J. Comb. Theory Ser. A 71 (1995) 127–145

    1995

  13. [13]

    Frankl, K

    P. Frankl, K. Ota and N. Tokushige, Covers in uniform intersecting families and a counterexample to a conjecture of Lov´ asz, J. Combin. Theory Ser. A 74 (1996) 33–42

    1996

  14. [14]

    Frankl and J

    P. Frankl and J. Wang, Intersecting families with covering number three, J. Combin. Theory Ser. B 171 (2025) 96–139

    2025

  15. [15]

    F¨ uredi, Matchings and covers in hypergraphs, Graphs Combin

    Z. F¨ uredi, Matchings and covers in hypergraphs, Graphs Combin. 4 (1988) 115–206

    1988

  16. [16]

    Hilton and E

    A. Hilton and E. Milner, Some intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2) 18 (1967) 369–384

    1967

  17. [17]

    Kupavskii, Intersecting families with covering number 3, J

    A. Kupavskii, Intersecting families with covering number 3, J. Combin. Theory Ser. B 177 (2026) 216-233

    2026

  18. [18]

    Lov´ asz, On minimax theorems of combinatorics, Math

    P. Lov´ asz, On minimax theorems of combinatorics, Math. Lapok 26 (1975) 209–264

    1975

  19. [19]

    Moura, Maximals-wiset-intersecting families of sets: kernels, generating sets, and enumeration, J

    L. Moura, Maximals-wiset-intersecting families of sets: kernels, generating sets, and enumeration, J. Combin. Theory Ser. A 87 (1999) 52–73. 20

    1999

  20. [20]

    Polcyn and A

    J. Polcyn and A. Ruci´ nski, A hierarchy of maximal intersecting triple systems, Opuscula Math. 37 (2017) 597–608

    2017

  21. [21]

    C. Shi, P. Frankl and J. Qian, On non-empty cross-intersecting families, Combinatorica 42 (2022) 1513–1525

    2022

  22. [22]

    Wilson, The exact bound in the Erd˝ os-Ko-Rado theorem, Combinatorica 4 (1984) 247–257

    R.M. Wilson, The exact bound in the Erd˝ os-Ko-Rado theorem, Combinatorica 4 (1984) 247–257. 21

    1984