加载中…
Kühn, Sauermann, Steiner and Wigderson recently disproved the Odd Hadwiger Conjecture, even for graphs with independence number 2. For this class of graphs the conjecture is known to be equivalent to the following: every -vertex graph with independence number 2 contains as an odd minor. While this does not hold, we prove that every graph with independence number 2 contains as an odd minor or as a totally odd immersion.

生成讲解博客的中文版本

生成AI智能校验的中文版本