论文标题
Hadwiger的猜想具有某些禁止的诱导子图
Hadwiger's Conjecture with Certain Forbidden Induced Subgraphs
论文作者
论文摘要
我们证明$ \ {\ overline {k_3}，h \} $ - 免费图不是对哈德威格的猜想的反描述，其中$ h $是七个，八个或九个顶点或$ h = k_8 $的33个图形中的任何一个。这改善了Plummer-Stiebitz-Toft，Kriesell和Bosse的过去结果。证明大多是计算机辅助的。
We prove that $\{\overline{K_3}, H\}$-free graphs are not counterexamples to Hadwiger's Conjecture, where $H$ is any one of 33 graphs on seven, eight, or nine vertices, or $H=K_8$. This improves on past results of Plummer-Stiebitz-Toft, Kriesell, and Bosse. The proofs are mostly computer-assisted.
