Skip to content
Preprint

Odd minors or odd immersions in graphs with independence number two

Aug 2026 · 0 citations · 33 references
Mathematics

Abstract

K\"{u}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 $n$-vertex graph $G$ with independence number 2 contains $K_{\lceil \frac n2 \rceil}$ as an odd minor. While this does not hold, we prove that every graph $G$ with independence number 2 contains $K_{\lceil \frac n2 \rceil}$ as an odd minor or as a totally odd immersion.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.