Erdős-Pósa property for labelled minors: 2-connected minors
arXiv:1805.00426
Abstract
In the 1960s, Erdős and Pósa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this: there is such a duality for -expansions in graphs if and only if is a planar graph (this includes the previous result for ). We consider vertex labelled graphs and minors and provide such a characterisation for -connected labelled graphs .
25 pages