Maximum planar subgraphs in dense graphs
Combinatorics
2013-01-09 v1
Abstract
K\"uhn, Osthus and Taraz 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.
Keywords
Cite
@article{arxiv.1301.1604,
title = {Maximum planar subgraphs in dense graphs},
author = {Peter Allen and Jozef Skokan and Andreas Würfl},
journal= {arXiv preprint arXiv:1301.1604},
year = {2013}
}
Comments
10 pages, 1 figure