2 problems

Eventual odd circular mixing conjecture. There exists an integer $q_0$ such that, for every integer $q\geq q_0$, the graph $G$ is $(2q+1,q)$-mixing.

Minimum-cycle conjecture. If $\chi(G)>k$, then $G$ contains at least