Maximum planar subgraphs in dense graphs
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.