Turán's extremal problem in random graphs: Forbidding even cycles (Q1898722)

For \(0< \gamma\leq 1\) and graphs \(G\) and \(H\), we write \(G@>> \gamma> H\) if any \(\gamma\)-proportions of the edges of \(G\) span at least one copy of \(H\) in \(G\). As customary, we write \(C^k\) for a cycle of length \(k\). We show that, for every fixed integer \(\ell\geq 2\) and real \(\gamma> 0\), there exists a constant \(C= C(\ell, \gamma)> 0\) such that almost every random graph \(G_{n, p}\) with \(p= p(n)\geq Cn^{- 1+ 1/(2\ell- 1)}\) satisfies \(G_{n, p}@>> \gamma> C^{2\ell}\). In particular, for any fixed \(\ell\geq 2\) and \(\gamma> 0\), this result implies the existence of very sparse graphs \(G\) with \(G@>> \gamma> C^{2\ell}\).