Maximum bipartite subgraphs of cubic triangle-free planar graphs

Thomassen recently proved, using the Tutte cycle technique, that if GG is a 3-connected cubic triangle-free planar graph then GG contains a bipartite subgraph with at least 29|V(G)|24−76 edges, improving the previously known lower bound 6|V(G)|5. We extend Thomassen’s technique and further improve this lower bound to 39|V(G)|32−916.