paper

Obstructions to Erdős-Pósa Dualities for Minors

arXiv:2407.09671

Abstract

Let and be minor-closed graph classes. The pair is an Erdős-Pósa pair (EP-pair) if there is a function where, for every and every either has pairwise vertex-disjoint subgraphs not belonging to or there is a set where and The classic result of Erdős and Pósa says that if is the class of forests, then is an EP-pair for every . The class is an EP-counterexample for if is minimal with the property that is not an EP-pair. We prove that for every the set of all EP-counterexamples for is finite. In particular, we provide a complete characterization of for every and give a constructive upper bound on its size. Each class can be described as all minors of a sequence of grid-like graphs Moreover, each admits a half-integral packing: copies of some where no vertex is used more than twice. This gives a complete delineation of the half-integrality threshold of the Erdős-Pósa property for minors and yields a constructive proof of Thomas' conjecture on the half-integral Erdős-Pósa property for minors (recently confirmed, non-constructively, by Liu). Let be the maximum size of a graph in For every class we construct an algorithm that, given a graph and a either outputs a half-integral packing of copies of some or outputs a set of at most vertices whose deletion creates a graph in in time

Accepted to FOCS 2024

Obstructions to Erdős-Pósa Dualities for Minors · wovepaper