The extremal number conjecture for powers of balanced rooted trees
The extremal number conjecture for powers of balanced rooted trees
Let be a balanced rooted tree, let be the graph formed from the union of distinct labelled copies of that agree on the roots and are otherwise disjoint, and let denote the rooted density of . Extremal number conjecture. For any balanced rooted tree ,
The preceding lower-bound result gives 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.