Maximum planar subgraphs in dense graphs (Q396794)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6330273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum planar subgraphs in dense graphs |
scientific article; zbMATH DE number 6330273 |
Statements
Maximum planar subgraphs in dense graphs (English)
0 references
14 August 2014
0 references
Summary: \textit{D. Kühn} et al. [J. Comb. Theory, Ser. B 95, No. 2, 263--282 (2005; Zbl 1075.05045)] 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\).
0 references
extremal graph theory
0 references
planar graphs
0 references
0.8835930824279785
0 references
0.7925562262535095
0 references
0.7764483094215393
0 references
0.7759144306182861
0 references
0.7624116539955139
0 references
