Title of article
Large minors in graphs with given independence number
Author/Authors
Balogh، نويسنده , , Jَzsef and Kostochka، نويسنده , , A.V.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
13
From page
2203
To page
2215
Abstract
A weakening of Hadwiger’s conjecture states that every n -vertex graph with independence number α has a clique minor of size at least n α . Extending ideas of Fox (2010) [6], we prove that such a graph has a clique minor with at least n ( 2 − c ) α vertices where c > 1 / 19.2 .
Keywords
Hadwiger’s conjecture , Clique minor , independence number
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1599723
Link To Document