Maximum planar subgraphs in dense graphs (Q396794)

Summary: \textit{D. Kühn} et al. [J. Comb. Theory, Ser. B 95, No. 2, 263--282 (2005; Zbl 1075.05045)] showed that for each \(\gamma>0\) there exists \(C\) such that any \(n\)-vertex graph with minimum degree \(\gamma n\) contains a planar subgraph with at least \(2n-C\) edges. We find the optimum value of \(C\) for all \(\gamma< 1/2\) and sufficiently large \(n\).