Graphs without minor complete subgraphs

DOI10.1016/j.disc.2005.11.064zbMath1115.05044OpenAlexW1988530353MaRDI QIDQ878614

A. Diánez, Martín Cera, Pedro García-Vázquez, J. Carlos Valenzuela-Tripodoro

Publication date: 26 April 2007

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

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

zbMATH Keywords

minorcomplete graphsextremal problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83)

Related Items (1)

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bound of the Hadwiger number of graphs by their 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 complete minors
• Homomorphiesätze für Graphen
• Homomorphism theorems for graphs
• An extremal function for contractions of graphs
• Contractions to k₈
• On Representatives of Subsets

This page was built for publication: Graphs without minor complete subgraphs