Extremal subgraphs of random graphs

We shall prove that if L is a 3‐chromatic (so called “forbidden”) graph, and —Rⁿ is a random graph on n vertices, whose edges are chosen independently, with probability p, and —Bⁿ is a bipartite subgraph of Rⁿ of maximum size, —Fⁿ is an L‐free subgraph of Rⁿ of maximum size, then (in some sense) Fⁿ and Bⁿ are very near to each other: almost surely they have almost the same number of edges, and one can delete O_p(1) edges from Fⁿ to obtain a bipartite graph. Moreover, with p = 1/2 and L any odd cycle, Fⁿ is almost surely bipartite.