Maximum Planar Subgraphs in Dense Graphs

@article{Allen2013MaximumPS,
  title={Maximum Planar Subgraphs in Dense Graphs},
  author={Peter Allen and Jozef Skokan and Andreas W{\"u}rfl},
  journal={Electron. J. Comb.},
  year={2013},
  volume={20},
  pages={P1}
}
  • Peter Allen, Jozef Skokan, Andreas Würfl
  • Published 2013
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • Kuuhn, 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 

    Figures from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES