Erdos-P\'osa property for labelled minors: 2-connected minors
Abstract
In the 1960s, Erdos and P\'osa 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 H-expansions in graphs if and only if H is a planar graph (this includes the previous result for H=K3). We consider vertex labelled graphs and minors and provide such a characterisation for 2-connected labelled graphs H.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.