Cookies?
Library Header Image
LSE Research Online LSE Library Services

Maximum planar subgraphs in dense graphs

Allen, Peter and Skokan, Jozef and Würfl, Andreas (2013) Maximum planar subgraphs in dense graphs. Electronic Journal of Combinatorics, 20 (3). ISSN 1077-8926

[img]
Preview
PDF
Download (578kB) | Preview

Identification Number: P1

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

Item Type: Article
Official URL: http://www.combinatorics.org/ojs/index.php/eljc/in...
Additional Information: © 2013 The Authors
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 02 Aug 2013 14:01
Last Modified: 13 Jun 2014 15:09
URI: http://eprints.lse.ac.uk/id/eprint/51362

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics