arxiv: 2604.19183 · v2 · submitted 2026-04-21 · 🧮 math.CO

Recognition: unknown

Counting sunflowers in hypergraphs with bounded matching number and ErdH{o}s Matching Conjecture in the (t,k)-norm

Authors on Pith no claims yet

Pith reviewed 2026-05-10 02:37 UTC · model grok-4.3

classification 🧮 math.CO MSC 05C6505D05

keywords sunflowersuniform hypergraphsmatching numberErdős matching conjectureshifting methodErdős–Ko–Rado theoremTurán-type problems

0 comments

The pith

r-uniform hypergraphs with bounded matching number achieve the same maximum number of sunflowers with fixed core size for every petal count k.

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

This paper determines the largest number of copies of the sunflower structure S_{r-1,k}^r that can appear in an r-uniform hypergraph whose largest collection of pairwise disjoint edges has size at most a fixed bound. It shows that both this maximum value and the hypergraphs attaining it are identical no matter what value k takes. The proof proceeds by verifying that a vertex-shifting operation, which concentrates edges around smaller sets, never lowers the sunflower count; this is done by exhibiting an explicit injection from the copies in the original hypergraph to those in the shifted one. The same technique then yields the Erdős Matching Conjecture when the hypergraph size is measured by the sum of k-th powers of the degrees of all (r-1)-subsets, and produces a corresponding weighted form of the Erdős–Ko–Rado theorem.

Core claim

In an r-uniform hypergraph with matching number at most s, the maximum number of copies of S_{r-1,k}^r is attained by the same extremal constructions for every k ≥ 1, and these constructions are fully characterized. The shifting operation never decreases the number of such copies, which is shown by constructing an injection between the sets of copies before and after the shift. Combining the result with the known solution of the unweighted Erdős Matching Conjecture and algebraic identities for power sums then establishes the conjecture in the (r-1,k)-norm for all k, together with a weighted Erdős–Ko–Rado theorem in the same norm.

What carries the argument

The shifting operation on r-uniform hypergraphs, shown via injection to preserve or increase the count of S_{r-1,k}^r copies while keeping the matching number unchanged.

If this is right

The Erdős Matching Conjecture holds when hypergraph size is measured in the (r-1,k)-norm for every k.
The Erdős–Ko–Rado theorem extends to the (r-1,k)-norm.
A direct counting method estimates the number of S_{r-1,k}^r copies in any r-uniform hypergraph.
The extremal hypergraphs and the maximum count itself are independent of k.

Where Pith is reading between the lines

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

The k-independence may indicate that weighted versions of matching problems remain stable across different exponents in the degree-power sum.
Shifting arguments of this type could be tested on counts of other fixed intersection patterns beyond sunflowers.

Load-bearing premise

That the shifting operation can always be performed without decreasing the number of S_{r-1,k}^r copies, which relies on the existence of the injection between copies before and after the shift.

What would settle it

An r-uniform hypergraph with matching number at most s that contains strictly more S_{r-1,k}^r copies than the stated extremal construction for some k, or a single shift that decreases the copy count.

Figures

Figures reproduced from arXiv: 2604.19183 by Junpeng Zhou, Xiying Yuan.

**Figure 1.** Figure 1: Shifting operations for several expansions 2.2. Counting subhypergraphs under shifting In this subsection, we investigate how the shifting operation affects the number of copies of subhypergraphs in an r-graph. This problem is crucial, as it determines whether we may first apply the shifting operation to H when counting copies of subhypergraphs in H. Liu and Wang [19] showed that the shifting operation doe… view at source ↗

**Figure 2.** Figure 2: The shifting operation for S r a,k Remark 2.5. This non-decreasing property of the shifting operation does not hold for all sunflowers. For example, the shifting operation may strictly decrease the number of copies of S r a,k in an r-graph whenever 1 ≤ a ≤ r − 2 and k ≥ 2 (see [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗

read the original abstract

It is well known that Erd\H{o}s Matching Conjecture concerns the maximum number of hyperedges in an $r$-uniform hypergraph with bounded matching number. As a generalization, it is natural to ask for the maximum number of copies of subhypergraphs. Given integers $r\geq2$ and $k\ge 1$, let $S_{r-1,k}^r$ denote the $r$-uniform hypergraph with hyperedges $\{e_1, \dots, e_k\}$ such that there exists an $(r-1)$-set $T$ with $e_i \cap e_j = T$ for $1\le i < j \le k$. We determine the maximum number of copies of $S_{r-1,k}^r$ in an $r$-uniform hypergraph with bounded matching number, and characterize all extremal hypergraphs. An interesting phenomenon is that the extremal numbers and extremal hypergraphs are exactly the same for all $k\ge 1$. Our main tool is the shifting method. By establishing an injection, we prove that the shifting operation does not decrease the number of copies of $S_{r-1,k}^r$ for all $k\geq1$, thereby answering a question raised by Wang and Peng (2026). Moreover, we present a counting method for estimating the number of copies of $S_{r-1,k}^r$ in arbitrary $r$-uniform hypergraphs. Counting the number of copies of $S_{r-1,k}^r$ in $r$-uniform hypergraphs is closely related to Tur\'{a}n problems in the $(r-1,k)$-norm proposed by Chen, Il'kovi\v{c}, Le\'{o}n, Liu and Pikhurko. The $(r-1,k)$-norm of an $r$-uniform hypergraph $\mathcal{H}$ is the sum of the $k$-th power of the degrees $d_{\mathcal{H}}(T)$ over all $(r-1)$-subsets $T \subseteq V(\mathcal{H})$. Combining our established result with that of Frankl (2013), and utilizing the Newton expansion of powers and Stirling numbers of the second kind, we show that Erd\H{o}s Matching Conjecture in the $(r-1,k)$-norm holds, which generalizes the result of Brooks and Linz concerning the $(r-1,2)$-norm case. As a consequence, we obtain a version of the classical Erd\H{o}s--Ko--Rado theorem in the $(r-1,k)$-norm.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper shows the max number of these sunflowers is independent of k and settles the Erdős Matching Conjecture in every (r-1,k)-norm via uniform shifting plus a Newton-Stirling reduction.

read the letter

The punchline is that the maximum number of S_{r-1,k}^r sunflowers in an r-uniform hypergraph with bounded matching number is independent of k, and this lets them prove the Erdős Matching Conjecture in the (r-1,k)-norm for all k at once. They achieve this with a shifting argument where they construct an injection showing the number of sunflowers does not decrease under the shift, for any k. This answers a question of Wang and Peng, and the independence is a nice phenomenon. Then they count the copies in general hypergraphs and use Newton expansion plus Stirling numbers to reduce the norm version to Frankl's 2013 theorem on the usual matching conjecture. That step also yields a norm version of EKR. The approach is clean and organizes prior work on small k. The citation to Frankl is appropriate as an external result. The main thing to watch is whether the injection really works when k is larger than 2. Multiple edges sharing the core T can interact with the shifted vertex, potentially violating the common intersection or causing the map to miss some sunflowers or collide. If the paper's construction handles all cases without exception, the result stands; otherwise the k-independence does not follow. The abstract sketches it, but the details matter here. This paper is for extremal combinatorists focused on hypergraphs and matching problems. A reader working on related Turán or EKR questions in norms would get value from the uniform proof and the new bounds. It deserves a serious referee because the claims are concrete and the techniques are standard enough to check. I recommend sending it out for peer review.

Referee Report

1 major / 0 minor

Summary. The paper determines the maximum number of copies of the r-uniform sunflower S_{r-1,k}^r (k edges sharing a common (r-1)-core) in an r-uniform hypergraph with bounded matching number, and characterizes the extremal examples. It proves that both the maximum and the extremal hypergraphs are independent of k for all k≥1. The main tool is a shifting argument establishing an injection showing that shifting never decreases the number of such copies; this is combined with a counting method and Frankl's 2013 result to prove the Erdős Matching Conjecture in the (r-1,k)-norm (via Newton expansion and Stirling numbers of the second kind), yielding a norm version of the EKR theorem.

Significance. If the central injection holds, the result gives a uniform extremal statement across all k, answering a question of Wang and Peng, and extends the classical Erdős Matching Conjecture both to counting specific subhypergraphs and to the (r-1,k)-norm. The self-contained shifting argument (not relying on fitted parameters) and the reduction to an external black-box result (Frankl 2013) are clear strengths; the use of Stirling numbers for the norm conversion is a clean technical contribution.

major comments (1)

The proof that shifting preserves (or does not decrease) the number of S_{r-1,k}^r copies rests on exhibiting an injection between pre- and post-shift copies that maintains the exact intersection pattern e_i ∩ e_j = T for the core T. For k≥3 this requires verifying that the map remains injective and lands on valid sunflowers even when multiple petals interact with the shifted vertex; the manuscript sketches the strategy but does not supply the explicit construction or case analysis needed to confirm this for arbitrary configurations.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and for the constructive feedback. We appreciate the positive evaluation of the results and their significance. We address the major comment below and have revised the manuscript to incorporate the requested details.

read point-by-point responses

Referee: The proof that shifting preserves (or does not decrease) the number of S_{r-1,k}^r copies rests on exhibiting an injection between pre- and post-shift copies that maintains the exact intersection pattern e_i ∩ e_j = T for the core T. For k≥3 this requires verifying that the map remains injective and lands on valid sunflowers even when multiple petals interact with the shifted vertex; the manuscript sketches the strategy but does not supply the explicit construction or case analysis needed to confirm this for arbitrary configurations.

Authors: We agree with the referee that the original presentation of the injection in the shifting argument was only sketched and lacked the explicit construction and full case analysis for k ≥ 3, particularly when multiple petals interact with the shifted vertex. In the revised manuscript, we have expanded the relevant section to include a complete definition of the injection: for a sunflower with core T, we map each affected petal by replacing the shifted vertex v with a fresh vertex w chosen from the available vertices outside the current hypergraph, ensuring e_i ∩ e_j = T is preserved for all pairs. We then provide a case-by-case verification covering (i) single-petal interactions, (ii) multiple petals sharing v, and (iii) configurations where the shift affects the core indirectly. Injectivity is established by exhibiting an inverse map on the image and showing that distinct pre-shift sunflowers produce distinct post-shift sunflowers. This confirms that the image consists of valid S_{r-1,k}^r copies and that the number of copies is non-decreasing under shifting for all k ≥ 1. revision: yes

Circularity Check

0 steps flagged

No circularity: shifting injection and external citation are independent

full rationale

The central derivation proceeds by constructing an explicit injection showing that shifting never decreases the number of S_{r-1,k}^r copies; this is a direct combinatorial map, not a redefinition or fit of the target quantity. The subsequent reduction to the (r-1,k)-norm EMC invokes Frankl (2013) as an external black-box result rather than a self-citation chain or ansatz smuggled from prior work by the same authors. No equation or claim reduces by construction to its own inputs, and the k-independence follows uniformly from the injection holding for all k≥1.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper introduces no free parameters, no new entities, and relies only on standard axioms of uniform hypergraphs, matchings, and degree sums.

axioms (1)

standard math Basic properties of r-uniform hypergraphs, matchings, and the definition of S_{r-1,k}^r
Invoked throughout the shifting argument and the norm definition.

pith-pipeline@v0.9.0 · 5803 in / 1394 out tokens · 46051 ms · 2026-05-10T02:37:08.998576+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

25 extracted references · 4 canonical work pages · 1 internal anchor

[1]

N. Alon, C. Shikhelman, ManyTcopies inH-free graphs,J. Combin. Theory Ser. B121(2016) 146–172

2016
[2]

Bollob´ as, D

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

1976
[3]

Some exact and asymptotic results for hypergraph Tur\'an problems in $\ell_2$-norm

G. Brooks, W. Linz, Some exact and asymptotic results for hypergraph Tur´ an problems inℓ2-norm, arXiv preprint, arXiv:2310.09379, 2023

work page internal anchor Pith review Pith/arXiv arXiv 2023
[4]

W. Chen, D. Il’koviˇ c, J. Le´ on, X. Liu, O. Pikhurko, Nondegenerate Tur´ an problems under (t, p)- norms,arXiv preprint, arXiv:2406.15934, 2024

work page arXiv 2024
[5]

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

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

1965
[6]

Erd˝ os, T

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

1959
[7]

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

1961
[8]

Frankl, The shifting technique in extremal set theory,Surv

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

1987
[9]

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

2017
[10]

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

2013
[11]

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
[12]

Frankl, A

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

2022
[13]

Frankl, T

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

2012
[14]

Gerbner, C

D. Gerbner, C. Palmer, Survey of generalized Tur´ an problems—counting subgraphs,Electron. J. Combin.33(1) (2026) #P1.23

2026
[15]

Graham, D

R. Graham, D. Knuth, O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 1994

1994
[16]

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
[17]

Kolupaev, A

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

2023
[18]

Kupavskii and G

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

work page arXiv 2025
[19]

E. Liu, J. Wang, The maximum number of cliques in hypergraphs without large matchings,Electron. J. Combin.(2020) P4.14. 15

2020
[20]

Luczak, K

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

2014
[21]

Mubayi, A hypergraph extension of Tur´ an’s theorem,J

D. Mubayi, A hypergraph extension of Tur´ an’s theorem,J. Combin. Theory Ser. B96(2006) 122–134

2006
[22]

Wang, The shifting method and generalized Tur´ an number of matchings,European J

J. Wang, The shifting method and generalized Tur´ an number of matchings,European J. Combin. 85(2020) 103057

2020
[23]

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

2026
[24]

B. Wu, H. Zhang, The Erd˝ os–Ko–Rado theorem inℓ 2-norm,European J. Combin.135(2026) 104369

2026
[25]

J. Zhou, X. Zhao, X. Yuan, On generalized Tur´ an problems for expansions,arXiv preprint, arXiv:2601.09244, 2026. 16

work page arXiv 2026