Pith. sign in

REVIEW 1 major objections 1 minor 1 cited by

A structural theorem characterizes large cross-intersecting pairs by their diversity parts and maximal extensions.

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 · grok-4.3

2026-06-26 17:02 UTC pith:OHKE5I4V

load-bearing objection Extends Kupavskii's structural theorem to cross-intersecting pairs via a new shift operator, but the local-substructure preservation claim needs checking. the 1 major comments →

arxiv 2606.20085 v1 pith:OHKE5I4V submitted 2026-06-18 math.CO

Structure and properties of large cross-intersecting families

Yang Huang , Andrey Kupavskii This is my paper
classification math.CO
keywords cross-intersecting familiesextremal combinatoricsstructural theoremshifting methoddiversitystability
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 proves a structural result for the largest cross-intersecting pairs of families, extending an earlier theorem of Kupavskii on intersecting families. It describes these extremal pairs in terms of diversity parts and maximal cross-intersecting extensions. The argument rests on a new shifting operation that keeps both global intersection properties and local substructures intact. This yields cross-intersecting versions of several known stability theorems as direct corollaries.

Core claim

Large cross-intersecting pairs are characterized by their diversity parts and maximal cross-intersecting extensions. The characterization is obtained by applying the S_{U,V}^Q-shift, which preserves both global intersection properties and certain local substructures.

What carries the argument

The S_{U,V}^Q-shift, a new shifting method that preserves global intersection properties and certain local substructures after shifting.

Load-bearing premise

The new S_{U,V}^Q-shift preserves both global intersection properties and certain local substructures after shifting.

What would settle it

A pair of large cross-intersecting families whose structure cannot be described in terms of diversity parts and maximal cross-intersecting extensions would serve as a counterexample.

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

Share X Bluesky LinkedIn Reddit HN

If this is right

  • Cross-intersecting analogues of the Han--Kohayakawa theorem hold.
  • Cross-intersecting analogues of the Huang--Peng theorem hold.
  • The same shifting technique applies to a product version of the Hilton--Milner theorem.
  • The structural description applies to all extremal pairs in the cross-intersecting setting.

Where Pith is reading between the lines

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

  • The shift operator may extend to other stability questions involving multiple families.
  • Similar structural results could appear for weighted or multipartite cross-intersecting settings.

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

1 major / 1 minor

Summary. The manuscript establishes a structural theorem for large cross-intersecting pairs of families on [n], extending Kupavskii's theorem from the intersecting to the cross-intersecting setting. It characterizes extremal pairs via their diversity parts and maximal cross-intersecting extensions. The proof relies on a new shifting operation, the S_{U,V}^Q-shift, which is claimed to preserve both the global cross-intersecting property and certain local substructures. Corollaries recover cross-intersecting analogues of the Han--Kohayakawa and Huang--Peng theorems.

Significance. If the claimed preservation properties of the new shift hold, the result supplies a useful structural stability theorem in the cross-intersecting regime and introduces a shifting technique that the authors indicate has already been applied to a product version of the Hilton--Milner theorem. Such tools are valuable in extremal set theory for deriving further stability and product-type results.

major comments (1)
  1. [Proof of the structural theorem (shift preservation step)] The central argument rests on the assertion that the S_{U,V}^Q-shift preserves local substructures even when the diversity part is non-trivial (see the description of the shift in the proof of the main structural theorem). The provided sketch does not explicitly verify this preservation on families whose diversity part is non-empty; if the local-substructure claim fails in such cases, the inductive step used to reach the extremal forms cannot be completed.
minor comments (1)
  1. The abstract states that the new shift 'maintains certain local substructures,' but the precise definition of the local substructures being preserved is not restated in the statement of the main theorem; adding a short explicit list would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and the constructive comment on our manuscript. We address the major comment below.

read point-by-point responses

  1. Referee: The central argument rests on the assertion that the S_{U,V}^Q-shift preserves local substructures even when the diversity part is non-trivial (see the description of the shift in the proof of the main structural theorem). The provided sketch does not explicitly verify this preservation on families whose diversity part is non-empty; if the local-substructure claim fails in such cases, the inductive step used to reach the extremal forms cannot be completed.

    Authors: We agree that the sketch provided in the proof of the structural theorem does not contain an explicit verification of the local-substructure preservation property in the case of a non-empty diversity part. This omission leaves the inductive step insufficiently justified in the current version. In the revised manuscript we will expand the relevant section to include a complete case analysis: we will enumerate the possible configurations of the diversity sets relative to U, V and Q, and verify directly that the S_{U,V}^Q-shift preserves the required local intersection relations in each case. This addition will make the argument self-contained and complete the induction. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on new shifting method and independent extension of prior result.

full rationale

The paper presents a structural theorem extending Kupavskii's prior result via a newly defined S_{U,V}^Q-shift that is asserted to preserve required properties. No equations or steps reduce the claimed characterization to a fitted input, self-definition, or self-citation chain by construction. The central argument is a proof using the new shift operator, which is external to the target statement. Self-citation to the author's earlier intersecting-family theorem is present but does not bear the load of the cross-intersecting extension, which is derived separately. This is the expected non-finding for a self-contained combinatorial proof paper.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract only; no free parameters, axioms, or invented entities are described or visible.

pith-pipeline@v0.9.1-grok · 5727 in / 1173 out tokens · 29070 ms · 2026-06-26T17:02:56.659001+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of Structure and properties of large cross-intersecting families." pith.science (2026). https://pith.science/paper/OHKE5I4V

@misc{pith2026260620085,
  author       = {Pith},
  title        = {Pith review of: Structure and properties of large cross-intersecting families},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OHKE5I4V}},
  note         = {Machine review of arXiv:2606.20085}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The study of intersecting families, initiated by Erd\H{o}s, Ko, and Rado, is a central topic in extremal combinatorics. A classical stability result of Hilton and Milner determines the largest non-trivial intersecting family, and in subsequent works researchers developed structural stability results via the notion of diversity. In this paper, we study cross-intersecting families. We establish a structural theorem for large cross-intersecting pairs, extending Kupavskii's theorem from intersecting families to the cross-intersecting setting. Our result characterizes extremal cross-intersecting pairs in terms of their diversity parts and maximal cross-intersecting extensions. As corollaries, we obtain cross-intersecting analogues of several classical theorems, including those of Han--Kohayakawa and Huang--Peng. A key ingredient in the proof is a new shifting method, called the $S_{U,V}^{Q}$-shift, which not only preserves global intersection properties but also maintains certain local substructures after shifting. We expect this method to be useful elsewhere, and it is already one of the key tools in establishing a product analogue of the Hilton--Milner theorem.

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. A sharp product bound for non-trivial cross-intersecting families

    math.CO 2026-06 unverdicted novelty 7.0

    Proves |A|*|B| <= h(n,k)^2 for non-trivial cross-intersecting k-uniform families A, B on [n] when n >= 2k and k >= 3, with extremal pair characterization.

Reference graph

Works this paper leans on

24 extracted references · 3 canonical work pages · cited by 1 Pith paper · 1 internal anchor

  1. [1]

    Y. Bai, H. Gu, Cross-intersecting families with covering number constraints, (2026), arXiv:2601.07679

    work page arXiv 2026

  2. [2]

    Daykin, Erd˝ os–Ko–Rado from Kruskal–Katona, Journal of Combinatorial Theory Ser

    D.E. Daykin, Erd˝ os–Ko–Rado from Kruskal–Katona, Journal of Combinatorial Theory Ser. A 17 (1974) 254–255

    1974

  3. [3]

    Erd˝ os, C

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

    1961

  4. [4]

    Frankl, Erd˝ os–Ko–Rado theorem with conditions on the maximal degree, J

    P. Frankl, Erd˝ os–Ko–Rado theorem with conditions on the maximal degree, J. Comb. Theory Ser. A 46 (1987) 252–263. 39

    1987

  5. [5]

    Frankl, On the maximum of the sum of the sizes of non-trivial cross-intersecting families, Combinatorica 44 (2024), 15–35

    P. Frankl, On the maximum of the sum of the sizes of non-trivial cross-intersecting families, Combinatorica 44 (2024), 15–35

    2024

  6. [6]

    Frankl, N

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

    1992

  7. [7]

    Frankl, A

    P. Frankl, A. Kupavskii, Sharp results concerning disjoint cross-intersecting families, European J. Combin. 86 (2020), Paper No. 103089

    2020

  8. [8]

    Frankl and A

    P. Frankl and A. Kupavskii, Diversity, J. Combin. Theory Ser. A 182 (2021), Paper No. 105468

    2021

  9. [9]

    Frankl, J

    P. Frankl, J. Wang, A product version of the Hilton–Milner Theorem, Journal of Combinatorial Theory, Series A 200 (2023) 105791

    2023

  10. [10]

    J. Han, Y. Kohayakawa, The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family, Proc. Amer. Math. Soc. 145 (1) (2017) 73–87

    2017

  11. [11]

    Hilton, The Erd˝ os–Ko–Rado theorem with valency conditions, (1976), unpublished manuscript

    A.J.W. Hilton, The Erd˝ os–Ko–Rado theorem with valency conditions, (1976), unpublished manuscript

    1976

  12. [12]

    Hilton, An intersection theorem for a collection of families of subsets of a finite set, J

    A.J.W. Hilton, An intersection theorem for a collection of families of subsets of a finite set, J. London Math. Soc. 2 (1977) 369–376

    1977

  13. [13]

    Hilton, E.C

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

    1967

  14. [14]

    Huang, A sharp product bound for non-trivial cross-intersecting families, manuscript, 2026

    Y. Huang, A sharp product bound for non-trivial cross-intersecting families, manuscript, 2026

    2026

  15. [15]

    Huang, Y

    Y. Huang, Y. Peng, Stability of intersecting families, European J. Combin. 115 (2024), Paper No. 103774

    2024

  16. [16]

    Huang, Y

    Y. Huang, Y. Peng, Non-empty pairwise cross-intersecting families, J. Combin. Theory Ser. A 211 (2025), Paper No. 105981

    2025

  17. [17]

    Huang, Y

    Y. Huang, Y. Peng, Complete characterization on maximum pairwise cross intersecting families (I), (2025), arXiv:2601.01929

    work page arXiv 2025

  18. [18]

    Katona, A theorem of finite sets, Theory of Graphs, Proc

    G.O.H. Katona, A theorem of finite sets, Theory of Graphs, Proc. Coll. Tihany 1966, Akad, Kiado, Budapest, 1968; Classic Papers in Combinatorics (1987), 381–401

    1966

  19. [19]

    Kostochka, D

    A. Kostochka, D. Mubayi, The structure of large intersecting families, Proc. Amer. Math. Soc. 145 (6) (2017) 2311–2321

    2017

  20. [20]

    Kruskal, The Number of Simplices in a Complex, Mathematical optimization techniques 251 (1963), 251–278

    J.B. Kruskal, The Number of Simplices in a Complex, Mathematical optimization techniques 251 (1963), 251–278

    1963

  21. [21]

    Structure and properties of large intersecting families

    A. Kupavskii, Structure and properties of large intersecting families, (2018), arXiv:1810.00920

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  22. [22]

    Kupavskii, Structure of non-trivial intersecting families, Proc

    A. Kupavskii, Structure of non-trivial intersecting families, Proc. Amer. Math. Soc., 153 (2025) 2863–2873

    2025

  23. [23]

    Kupavskii, D

    A. Kupavskii, D. Zakharov, Regular bipartite graphs and intersecting families, J. Comb. Theory Ser. A 155 (2018) 180–189

    2018

  24. [24]

    Lov´ asz, Problem 13.31, in: Combinatorial Problems and Exercises, North Holland, 1979

    L. Lov´ asz, Problem 13.31, in: Combinatorial Problems and Exercises, North Holland, 1979. 40

    1979