Average degree conditions forcing a minor

zbMath1333.05278arXiv1506.01775MaRDI QIDQ259170

David R. Wood, Daniel J. Harvey

Publication date: 11 March 2016

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

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

File on IPFS

zbMATH Keywords

average degreegraph minors

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items (4)

The extremal function for disconnected minors ⋮ A lower bound on the average degree forcing a minor ⋮ Asymptotic density of graphs excluding disconnected minors ⋮ The extremal function for Petersen minors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge-density for \(K_{2,t}\) minors
• Forcing unbalanced complete bipartite minors
• Dense graphs have \(K_{3,t}\) minors
• Lower bound of the Hadwiger number of graphs by their average degree
• On \(K_{s,t}\)-minors in graphs with given average degree
• On the maximum density of graphs which have no subcontraction to \(K^ r\).
• Hadwiger's conjecture is true for almost every graph
• The extremal function for unbalanced bipartite minors
• On \(K_{s,t}\)-minors in graphs with given average degree. II
• The extremal function for complete minors
• The extremal function for noncomplete minors
• The extremal function for \(K_{9}\) minors
• Homomorphiesätze für Graphen
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Hadwiger’s Conjecture
• An extremal function for contractions of graphs
• Contractions to k₈
• Connected Domination and Spanning Trees with Many Leaves
• Forcing a sparse minor

This page was built for publication: Average degree conditions forcing a minor