Janzer's conjecture on blowups of spiders

Let s2s\geq2, k,b,t1k,b,t\geq1 be integers. Let SS be an ss-legged spider whose longest leg has length kk, and suppose that e(S)=(s1)k+be(S)=(s-1)k+b, where 0bk0\leq b\leq k. Let tSt*S denote the union of tt copies of SS sharing the designated roots as in the spider blowup construction. Janzer's conjecture.

ex(n,tS)=O(n1+s1(s1)k+b).\mathrm{ex}(n,t*S)=O\left(n^{1+\frac{s-1}{(s-1)k+b}}\right).

This conjecture concerns extremal numbers of blowups of spiders and is motivated by results for subdivisions of complete bipartite graphs and related graphs. The source presents it as an open conjecture.

Sources & referencesView supporting material

Primary source

Tao Jiang and Yu Qiu, “Many Turan exponents via subdivisions”, arXiv:1908.02385 (2019).

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.