Random polynomial graphs for random Turán problems

Abstract

AbstractBukh and Conlon used random polynomial graphs to give effective lower bounds on , where is the th power of a balanced rooted tree . We extend their result to give effective lower bounds on , which is the maximum number of edges in a ‐free subgraph of the random graph . Analogous bounds for generalized Turán numbers in random graphs are also proven.