Asymptotic extremal conjecture for path blowups

Let a+b=ra+b=r, with a,b1a,b\geq 1, and let P(a,b)P_\ell(a,b) be the (a,b)(a,b)-blowup of a path of length \ell, where {2k1,2k}\ell\in\{2k-1,2k\} and 4\ell\geq 4. For fixed a,b,r,ka,b,r,k, define

Ψk1(n,r):={E[n]:E=r, E[k1]}.\Psi_{k-1}(n,r):=\{E\subset [n]: |E|=r,\ E\cap [k-1]\ne\emptyset\}.

Path-blowup conjecture. The family Ψk1(n,r)\Psi_{k-1}(n,r) gives the correct asymptotic of the Turán number in all the above cases.

The theorem preceding this conjecture proves the assertion for odd rr when \ell is odd and for a>ba>b when \ell is even; the remaining cases, namely even \ell with aba\leq b, are stated to be open.

Sources & referencesView supporting material

Primary source

Zoltán Füredi, Tao Jiang, Alexandr Kostochka, Dhruv Mubayi and Jacques Verstraëte, “Extremal problems for hypergraph blowups of trees”, arXiv:2003.00622 (2020).

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.