Maximum planar subgraphs in dense graphs

zbMath1298.05170arXiv1301.1604MaRDI QIDQ396794

Mohammad Hasan, H. S. Yoon

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.1604

zbMATH Keywords

planar graphsextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Density (toughness, etc.) (05C42)

Related Items

Properties of \(\pi\)-skew graphs with applications, An Extension of the Blow-up Lemma to Arrangeable Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Blow-up lemma
• Graphs with linearly bounded Ramsey numbers
• Large planar subgraphs in dense graphs
• Some new results in extremal graph theory
• Radius two trees specify χ‐bounded classes
• An Extension of the Blow-up Lemma to Arrangeable Graphs
• Spanning triangulations in graphs
• On the structure of linear graphs