On the maximum density of graphs which have no subcontraction to \(K^ r\).

DOI10.1016/0012-365X(83)90280-7zbMath0517.05045MaRDI QIDQ1053033

Wenceslas Fernandez de la Vega

Publication date: 1983

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

zbMATH Keywords

densityHadwiger numbersubcontraction

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (15)

The extremal functions for triangle-free graphs with excluded minors ⋮ Connected cutsets of a graph and triangle bases of the cycle space ⋮ Cliques in graphs excluding a complete graph minor ⋮ Tournaments as strong subcontractions ⋮ Graphs without minor complete subgraphs ⋮ A lower bound on the average degree forcing a minor ⋮ The extremal function for unbalanced bipartite minors ⋮ Forcing a sparse minor ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor ⋮ On the purity of minor-closed classes of graphs ⋮ The extremal function for Petersen minors ⋮ The extremal function for \(K_{9}\) minors ⋮ Hadwiger’s Conjecture ⋮ The extremal function for complete minors ⋮ Average degree conditions forcing a minor

Cites Work

• Unnamed Item
• Hadwiger's conjecture is true for almost every graph
• Homomorphiesätze für Graphen

This page was built for publication: On the maximum density of graphs which have no subcontraction to \(K^ r\).