The extremal number conjecture for powers of balanced rooted trees

Let (T,R)(T,R) be a balanced rooted tree, let TpT^p be the graph formed from the union of pp distinct labelled copies of TT that agree on the roots RR and are otherwise disjoint, and let ρT\rho_T denote the rooted density of TT. Extremal number conjecture. For any balanced rooted tree (T,R)(T,R),

ex(n,Tp)=Op(n21/ρT).\operatorname{ex}(n,T^p)=O_p\left(n^{2-1/\rho_T}\right).

The preceding lower-bound result gives ex(n,Tp)=Ω(n21/ρT)\operatorname{ex}(n,T^p)=\Omega(n^{2-1/\rho_T}) for balanced rooted trees, so this conjecture would determine the order of magnitude of the extremal number. It is posed as the corresponding upper bound and remains open in the source.

Sources & referencesView supporting material

Primary source

Boris Bukh and David Conlon, “Rational exponents in extremal graph theory”, arXiv:1506.06406 (2017).

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.