1 problem

Gartland–Lokastov's conjecture. For every planar graph $H$, there exists $k\in\mathbb{N}$ such that every $H$-induced-minor-free graph $G$ admits a $(k,1)$-balanced separator.