Making a C6C6-free graph C4C4-free and bipartite

We show that every C6C6-free graph GG has a C4C4-free, bipartite subgraph with at least 3e(G)/83e(G)/8 edges. Our proof is probabilistic and uses a theorem of Füredi et al. (2006) on C6C6-free graphs.