Forbidding anticomplete planar minors: Induced Erdős--Pósa property and Maximum Independent Set in QP

Maria Chudnovsky, Amadeus Reinald, Stéphan Thomassé

The Erdős--Pósa theorem asserts that every graph $G$ with no $k$ disjoint cycles contains a set $X$ of $f(k)$ vertices such that $G\setminus X$ has no cycle. Robertson and Seymour…