Mubayi's supersaturation conjecture for stable non-r-partite hypergraphs
Fix . An -uniform hypergraph, or -graph, is a family of -subsets of a vertex set; write for its number of edges. For an -graph , let
Assume that, for all sufficiently large , the extremal -vertex -free -graph is unique, and denote it by . Let be the number of labelled copies of in , and define
Mubayi's conjecture. If is a stable non--partite -graph, then, for every positive integer and all sufficiently large , every -vertex -graph with edges contains at least
copies of . This proposes that the one-edge cost above a rigid extremal construction gives the correct linear lower bound for every fixed excess ; 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
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.