The large ambient multiplicity conjecture for the Mubayi–Terry problem

From papers

Let sZ2s\in\mathbb{Z}_{\geq 2} and let qq be an integer with 0q<(s2)0\leq q<\binom{s}{2}. A generalized Turán pattern is a pattern T=T[r;a]T=\mathrm{T}[\mathbf{r};a] whose blow-ups are (s,a(s2)+q)(s,a\binom{s}{2}+q)-graphs. Large ambient multiplicity conjecture. There exists a unique generalized Turán pattern T=T[r;a]T=\mathrm{T}[\mathbf{r};a] such that its blow-ups are (s,a(s2)+q)(s,a\binom{s}{2}+q)-graphs and, for all sufficiently large aa,

exΠ(n,s,a(s2)+q)=Πn(T[r;a])1+o(1).\operatorname{ex}_\Pi\bigl(n,s,a\binom{s}{2}+q\bigr)=\Pi_n(\mathrm{T}[\mathbf{r};a])^{1+o(1)}.

This conjecture seeks a complete description of the Mubayi–Terry problem for sufficiently large ambient edge multiplicity. The preceding results establish substantial special cases, but the asserted uniqueness and asymptotic optimality in full generality remain open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Victor Falgas-Ravry, Adva Mond, Rik Sarkar and Victor Souza, “On problems in extremal multigraph theory”, arXiv:2505.14281 (2025).

Solutions 0

No solutions have been posted yet.