Disjoint unions of complete minors

DOI10.1016/j.disc.2007.08.021zbMath1171.05049OpenAlexW1969934473MaRDI QIDQ941374

Andrew G. Thomason

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.021

zbMATH Keywords

minor extremal

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items

Disjoint complete minors and bipartite minors ⋮ The extremal function for disconnected minors ⋮ Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets ⋮ A lower bound on the average degree forcing a minor ⋮ Forcing a sparse minor ⋮ Asymptotic density of graphs excluding disconnected minors ⋮ The extremal function for Petersen minors ⋮ Extremal functions for sparse minors

Cites Work

• Forcing unbalanced complete bipartite minors
• Lower bound of the Hadwiger number of graphs by their average degree
• On \(K_{s,t}\)-minors in graphs with given average degree
• The extremal function for unbalanced bipartite minors
• Disjoint \(K_{r}\)-minors in large graphs with given average degree
• The extremal function for complete minors
• The extremal function for noncomplete minors
• Homomorphiesätze für Graphen
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• An extremal function for contractions of graphs
• On Independent Complete Subgraphs in a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item