← All problems

Mubayi's supersaturation conjecture for stable non-r-partite hypergraphs

Less than 1 year old · traced to

Fix r≥2r\ge 2. An rr-uniform hypergraph, or rr-graph, is a family of rr-subsets of a vertex set; write ∣H∣|\mathcal H| for its number of edges. For an rr-graph F\mathcal F, let

ex⁡(n,F)=max⁡{∣H∣:∣V(H)∣=n and H is F-free}.\operatorname{ex}(n,\mathcal F)=\max\big\{|\mathcal H|:|V(\mathcal H)|=n\text{ and }\mathcal H\text{ is }\mathcal F\text{-free}\big\}.

Assume that, for all sufficiently large nn, the extremal nn-vertex F\mathcal F-free rr-graph is unique, and denote it by EX⁡(n,F)\operatorname{EX}(n,\mathcal F). Let NF(G)N_{\mathcal F}(\mathcal G) be the number of labelled copies of F\mathcal F in G\mathcal G, and define

c(n,F)=min⁡{NF(EX⁡(n,F)∪{e};e):e∈(V(EX⁡(n,F))r)∖EX⁡(n,F)}.c(n,\mathcal F)=\min\left\{N_{\mathcal F}(\operatorname{EX}(n,\mathcal F)\cup\{e\};e):e\in\binom{V(\operatorname{EX}(n,\mathcal F))}{r}\setminus\operatorname{EX}(n,\mathcal F)\right\}.

Mubayi's conjecture. If F\mathcal F is a stable non-rr-partite rr-graph, then, for every positive integer qq and all sufficiently large nn, every nn-vertex rr-graph with ex⁡(n,F)+q\operatorname{ex}(n,\mathcal F)+q edges contains at least

q c(n,F)q\,c(n,\mathcal F)

copies of F\mathcal F. This proposes that the one-edge cost above a rigid extremal construction gives the correct linear lower bound for every fixed excess qq; the paper studies strong counterexamples, so the conjecture is not established here and its status should be checked.

References

2 papers in this index state this conjecture (2026). The statement above is taken from the most recent of them; the others are arXiv:2606.09518.

Source: Heng Li, Hong Liu, Xizhi Liu and Jing Wang, “Strong counterexamples to Mubayi's supersaturation conjecture in every uniformity”, arXiv:2606.26735 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.