Pith. sign in

REVIEW 2 minor 1 cited by

Typical intersecting families are trivial

T0 review · 0 major / 2 minor · reviewed 2026-06-27 · grok-4.3

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

Pith's one-line read For n at least 2k plus about 2 sqrt(k log k) and large k, the number of intersecting families with sets of size at most k equals n plus lower order times 2 to the sum of binom(n-1,i-1) from i=1 to k.

desk verdict Extends uniform intersecting family counts to the non-uniform bounded case, giving an asymptotic that shows most are stars when n is at least roughly 2k plus a sqrt term. read the letter →

arxiv 2606.17679 v1 pith:OQCTFLLJ submitted 2026-06-16 math.CO

Yandong Bai , Haoyun Gu , Wenston J.T. Zang This is my paper · ORCID
classification math.CO
keywords intersectingfamiliesextremalsettheorycountingasymptoticstrivialnon-uniformboundedsize
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 paper counts the intersecting families inside the power set of an n-element set where every member has size at most k. It proves that this count is asymptotically the same as the number obtained by picking one common element and taking all sets of size at most k that contain it, then multiplying by the n choices for that element. The result shows that nearly every such family is trivial in the sense that it is contained in one of the n maximal trivial families. This extends earlier counting theorems that were known only for families of sets of exactly one fixed size.

What carries the argument

The counting function J(n,k) for the number of intersecting families on [n] with all sets of size at most k, shown to be asymptotically dominated by the n trivial families that fix one element.

What would settle it

An explicit computation or lower-bound construction for some sequence of pairs (n,k) obeying the size condition where the ratio of J(n,k) to n times the given power of 2 fails to approach 1.

Watch

Extended reading notes

Core claim

The paper proves that J(n,k) equals (n + o(1)) times 2 raised to the sum from i=1 to k of binom(n-1, i-1), whenever n is at least 2k + 2 + 2 sqrt(k log k) and k tends to infinity. This equality shows that almost every intersecting family with maximum size k shares a single common element.

Load-bearing premise

The size condition that n is at least 2k plus 2 plus 2 times the square root of k log k, with k tending to infinity, must hold for the stated asymptotic equality.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

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

0 major / 2 minor

Summary. The paper proves that for n ≥ 2k + 2 + 2√(k log k) with k → +∞, the number J(n,k) of intersecting families F ⊆ 2^[n] in which every set has size at most k equals (n + o(1)) 2^{∑_{i=1}^k binom(n-1,i-1)}. This shows that almost all such families are trivial (stars).

Significance. The result supplies a counting analogue of the Erdős–Ko–Rado theorem for non-uniform families of bounded size. It extends uniform-case counting theorems by showing that the contribution of non-trivial intersecting families is o(2^s) once n is sufficiently larger than k, using direct comparison of maximum sizes rather than fitted parameters.

minor comments (2)
  1. [Introduction] §1, after the definition of J(n,k): the exponent ∑ binom(n-1,i-1) is the size of the largest star; a one-sentence reminder of this combinatorial interpretation would help readers who skip the uniform-case literature.
  2. [Abstract] The o(1) term is stated to hold as k → ∞ under the given n-vs-k inequality; the proof sketch in the abstract does not indicate whether the error is uniform in n or requires an explicit rate.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary of our result and for recommending minor revision. The referee's description of the main theorem is accurate.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The derivation establishes an asymptotic count J(n,k) by showing that non-trivial intersecting families contribute only o(2^s) under the given n-vs-k threshold, using direct size comparisons between the star and the maximum non-trivial family. This is a standard extremal counting argument with no self-definitional reductions, no fitted parameters renamed as predictions, and no load-bearing self-citations that collapse the central claim. The result is self-contained against the combinatorial inputs and the stated condition.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

Relies on standard combinatorial counting and asymptotic analysis; no free parameters, invented entities, or ad-hoc axioms visible in abstract.

assumptions (1)
  • standard math Standard properties of binomial coefficients and power sets in finite combinatorics
    Used implicitly in defining the count of trivial families.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Typical intersecting families are trivial." pith.science (2026). https://pith.science/paper/OQCTFLLJ

@misc{pith2026260617679,
  author       = {Pith},
  title        = {Pith review of: Typical intersecting families are trivial},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OQCTFLLJ}},
  note         = {Machine review of arXiv:2606.17679}
}
abstract

We study the counting problem for non-uniform intersecting families in extremal set theory. Let $J(n,k)$ denote the number of intersecting families $\mathcal{F}\subset 2^{[n]}$ such that every member of $\mathcal{F}$ has size at most $k$. Extending recent counting results for uniform intersecting families, we prove that for $n\ge 2k+2+2\sqrt{k \log k}$ and $k \rightarrow +\infty$, \[ J(n,k) =(n+o(1)) 2^{\sum_{i=1}^{k} \binom{n-1}{i-1}}. \] This result reveals that typical non-uniform intersecting families of bounded size are trivial, i.e., almost all such families share a common fixed element.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. A gap theorem for non-trivial maximal intersecting families and an exact weighted asymptotic

    math.CO 2026-07 accept novelty 7.0 of 10

    Among non-trivial maximal intersecting families, every family other than the n one-flip stars has weight exponent at least 2^{n-2}-4 below the maximum, yielding the exact prefactor R(n)=(3/4+o(1)) n 2^{3^{n-1}-2^{n-1}+2}.

Reference graph

Works this paper leans on

7 extracted references · cited by 1 Pith paper

  1. [1]

    Balogh, R

    J. Balogh, R. Morris, W. Samotij, Independent sets in hypergraphs,J. Am. Math. Soc.28(2015), 669–709

    2015

  2. [2]

    Balogh, S

    J. Balogh, S. Das, M. Delcourt, H. Liu, M. Sharifzadeh, Intersecting families of discrete structures are typically trivial,J. Comb. Theory, Ser. A132(2015), 224–245

    2015

  3. [3]

    Balogh, S

    J. Balogh, S. Das, H. Liu, M. Sharifzadeh, T. Tran, Structure and supersaturation for intersecting families, Electron. J. Comb.26(2019)

    2019

  4. [4]

    Erd˝ os, C

    P. Erd˝ os, C. Ko, R. Rado, Intersection theorems for systems of finite sets,Q. J. Math. Oxford2(1961) 313-320

    1961

  5. [5]

    Frankl, A

    P. Frankl, A. Kupavskii, Counting intersecting and pairs of cross-intersecting families,Comb. Probab. Com- put.27(2018), 60–68

    2018

  6. [6]

    Frankl, N

    P. Frankl, N. Tokushige, Some best possible inequalities concerning cross-intersecting families,J. Combin. Theory Ser. A61(1992) 87-97

    1992

  7. [7]

    A. J. W. Hilton, E. C. Milner, Some intersection theorems for systems of finite sets,Quart. J. Math. Oxford Ser.18(1967) 369-384. 5

    1967

Pith tools

Reviewed June 27, 2026 · model on record in the stance chip above.