Turán's extremal problem in random graphs: Forbidding odd cycles
For a fixed odd number \(m \geq 3\) and a sufficiently large probability \(p\), almost every random graph \(G_{n,p}\) is shown to have an \(m\)-cycle free subgraph of size arbitrarily close to half the size of \(G_{n,p}\).
scientific article; zbMATH DE number 878265