Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)

DOI10.1007/s00493-005-0025-7zbMath1089.05035OpenAlexW2049333963MaRDI QIDQ2568497

W. Mader

Publication date: 27 June 2006

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-005-0025-7

zbMATH Keywords

extremal graphsno subdivision of \(K_5\)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (5)

New exact values of the maximum size of graphs free of topological complete subgraphs ⋮ Locally Hamiltonian graphs and minimal size of maximal graphs on a surface ⋮ On second order degree of graphs ⋮ Topological minors in bipartite graphs ⋮ What is on his mind?

This page was built for publication: Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)