Large minors in graphs with given independence number

DOI10.1016/j.disc.2011.07.003zbMath1235.05132OpenAlexW2129691542MaRDI QIDQ641195

József Balogh, Alexandr V. Kostochka

Publication date: 21 October 2011

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

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

zbMATH Keywords

independence numberHadwiger's conjectureclique minor

Mathematics Subject Classification ID

Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Large immersions in graphs with independence number 3 and 4 ⋮ A width parameter useful for chordal and co-comparability graphs ⋮ Clique immersions and independence number ⋮ Clique minors in graphs with a forbidden subgraph ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Hadwiger’s Conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique minors in claw-free graphs
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Packing seagulls
• Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
• Über eine Eigenschaft der ebenen Komplexe
• Complete minors, independent sets, and chordal graphs
• Complete Minors and Independence Number
• On Hadwiger's Number and the Stability Number
• Some Ramsey-Type Numbers and the Independence Ratio
• On a special case of Hadwiger's conjecture
• Independence number and clique minors
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: Large minors in graphs with given independence number