\(3n-5\) edges do force a subdivision of \(K_5\)

DOI10.1007/s004930050041zbMath0924.05039OpenAlexW1980706283WikidataQ63406263 ScholiaQ63406263MaRDI QIDQ1307446

W. Mader

Publication date: 31 October 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050041

zbMATH Keywords

extremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (31)

Subdivisions in apex graphs ⋮ $K_5^-$-Subdivision in 4-Connected Graphs ⋮ New exact values of the maximum size of graphs free of topological complete subgraphs ⋮ Independent paths and \(K_{5}\)-subdivisions ⋮ Locally Hamiltonian graphs and minimal size of maximal graphs on a surface ⋮ Six variations on a theme: almost planar graphs ⋮ Wheels in planar graphs and Hajós graphs ⋮ 4‐Separations in Hajós graphs ⋮ Remarks on a conjecture of Barát and Tóth ⋮ A decomposition method on solving the linear arboricity conjecture ⋮ Topological minors in bipartite graphs ⋮ Topological minors in line graphs -- a proof of Zha's conjecture ⋮ On embeddability and stresses of graphs ⋮ An advance in infinite graph models for the analysis of transportation networks ⋮ Saturation numbers for families of graph subdivisions ⋮ Some remarks on Hajós' conjecture ⋮ What is on his mind? ⋮ Reducing Hajós' 4-coloring conjecture to 4-connected graphs ⋮ The edge colorings of \(K_5\)-minor free graphs ⋮ On a coloring conjecture of Hajós ⋮ Counting \(K_4\)-subdivisions ⋮ Graphs Containing TopologicalH ⋮ K₆-minors in triangulations and complete quadrangulations ⋮ Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Subdivisions ofK₅in Graphs Embedded on Surfaces With Face-Width at Least 5 ⋮ Connectivity for Kite-Linked Graphs ⋮ STRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp) ⋮ Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) ⋮ Tuza's conjecture for graphs with maximum average degree less than 7 ⋮ Unique Colorability and Clique Minors

This page was built for publication: \(3n-5\) edges do force a subdivision of \(K_5\)