Graphs without minor complete subgraphs

DOI10.1016/J.DISC.2005.11.064MaRDI QIDQ878614zbMATH OpenOpenAlexFDO

Authors A. Diánez, Martín Cera, P. 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

extremal problemsminorcomplete graphs

Mathematics Subject Classification ID

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

Recommendations

• Minor extremal problems using Turan graphs
• scientific article; zbMATH DE number 2192148
• The extremal function for noncomplete minors
• Cliques in graphs excluding a complete graph minor
• New exact values of the maximum size of graphs free of topological complete subgraphs

Cites work

• scientific article; zbMATH DE number 3865318 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 2192148 (Why is no real title available?)
• scientific article; zbMATH DE number 3102312 (Why is no real title available?)
• An extremal function for contractions of graphs
• Contractions to k₈
• Hadwiger's conjecture is true for almost every graph
• Homomorphiesätze für Graphen
• Homomorphism theorems for graphs
• Lower bound of the Hadwiger number of graphs by their average degree
• On Representatives of Subsets
• On the maximum density of graphs which have no subcontraction to \(K^ r\).
• The extremal function for complete minors

Cited in

(11)

• Graphs without theta subgraphs
• Graphs with no \(\bar{P}_7\)-minor
• scientific article; zbMATH DE number 4139791 (Why is no real title available?)
• Extremal Graphs without Topological Complete Subgraphs
• The Size of a Graph Without Topological Complete Subgraphs
• scientific article; zbMATH DE number 2192148 (Why is no real title available?)
• Complete Minors in Graphs Without Sparse Cuts
• Cliques in graphs excluding a complete graph minor
• The extremal function for noncomplete minors
• Minor extremal problems using Turan graphs
• Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878614)