Odd-minor Duchet–Meyniel conjecture of Ji, Song, Weiss, and Zhang

Let $G$ be a graph of order $n$, let $\alpha(G)$ denote its independence number, and let $oh(G)$ be the largest integer $\ell$ such that $G$ has an odd $K_\ell$ minor.

Odd-minor Duchet–Meyniel conjecture. For any graph $G$ of order $n$,

$$oh(G)\geq \left\lceil\frac{n}{\alpha(G)}\right\rceil.$$

This is the odd-minor analogue of the Duchet–Meyniel conjecture and is stronger than the corresponding lower bound obtained by replacing $oh(G)$ with the ordinary minor parameter. The source does not state whether it has been resolved.