solidot新版网站常见问题，请点击这里查看。
消息
本文已被查看3798次
Complete minors and stability numbers. (arXiv:1810.03306v1 [math.CO])
来源于:arXiv
Hadwiger's conjecture implies that $n\le\alpha h$ for all graphs of order
$n$, stability number $\alpha $, and Hadwiger number $h$. Combining ideas of
Kawarabayashi et al. and Wood, we prove that $n\le (\alpha-1)(2h-5)+5$ for such
graphs if $\alpha\ge 3$ and $h\ge 5$. 查看全文>>
