1 problem

Let $k\geq 3$, and let $G$ be a graph that is $\{C_4,C_6,C_{2k}\}$-free. Lin–Zeng's conjecture. The existence of a perfect matching in the hypotheses of their bisection result can…