“…Only sporadic results for
are known when
contains a bipartite graph, and in most cases these bounds are not tight. For example, the Kővári–Sós–Turán theorem [
30] implies
, and this bound is only known to be tight when
is sufficiently large in terms of
; see, for example, recent work of Bukh [
6].…”