Day, Falgas–Ravry and Treglown's generalized Turán pattern conjecture

Let a,r,s,dZ0a, r, s, d \in \mathbb{Z}_{\geq 0} with a,r2a,r\geq 2, a>da>d, and s(r1)(d+1)+2s\geq (r-1)(d+1)+2. Let r\mathbf{r} denote the (d+1)(d+1)-tuple

r=(r1,0,0,,0,1).\mathbf{r}=(r-1,0,0,\dotsc,0,1).

Day, Falgas–Ravry and Treglown's conjecture. For all nn sufficiently large,

exΠ(n,s,Σs(T[r;a]))=Πn(T[r;a]).\operatorname{ex}_\Pi\bigl(n,s,\Sigma_s(\mathrm{T}[\mathbf{r};a])\bigr)=\Pi_n(\mathrm{T}[\mathbf{r};a]).

This generalizes Mubayi and Terry's conjecture for (s,q)=(4,a(42)+3)(s,q)=(4,a\binom{4}{2}+3). The claim is asymptotically true in the base case and, more generally, for sufficiently large aa, but the full statement remains open.

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).

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.