Maximum planar subgraphs in dense graphs
Allen, P.
, Skokan, J. & Würfl, A.
(2013).
Maximum planar subgraphs in dense graphs.
Electronic Journal of Combinatorics,
20(3).
https://doi.org/P1
, Skokan, J. & Würfl, A.
(2013).
Maximum planar subgraphs in dense graphs.
Electronic Journal of Combinatorics,
20(3).
https://doi.org/P1
Küuhn, Osthus and Taraz showed that for each γ >0 there exists C such that any n-vertex graph with minimum degree γn contains a planar subgraph with at least 2n - C edges. We find the optimum value of C for all γ< 1/2 and sufficiently large n