Hadwiger's conjecture implies that $n\leαh$ for all graphs of order $n$, stability number $α$, and Hadwiger number $h$. Combining ideas of Kawarabayashi et al. and Wood, we prove that $n\le (α-1)(2h-5)+5$ for such graphs if $α\ge 3$ and $h\ge 5$.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。