Complete minors, independent sets, and chordal graphs

From MaRDI portal
Publication:2906352

DOI10.7151/DMGT.1571zbMATH Open1255.05184arXiv0907.2421OpenAlexW2963039457MaRDI QIDQ2906352FDOQ2906352


Authors: József Balogh, John Lenz, Hehui Wu Edit this on Wikidata


Publication date: 5 September 2012

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Abstract: The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conjecture states that h(G) >= chi(G). Since chi(G) alpha(G) >= |V(G)|, Hadwiger's Conjecture implies that alpha(G) h(G) >= |V(G)|. We show that (2 alpha(G) - lceil log_t(t alpha(G)/2) ceil) h(G) geq |V(G)| where t is approximately 6.83. For graphs with alpha(G) geq 14, this improves on a recent result of Kawarabayashi and Song who showed (2 alpha(G) - 2) h(G) >= |V(G)| when alpha(G) >= 3.


Full work available at URL: https://arxiv.org/abs/0907.2421




Recommendations





Cited In (10)





This page was built for publication: Complete minors, independent sets, and chordal graphs

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