The edge-Erdos-P\'osa property

Abstract

Robertson and Seymour proved that the family of all graphs containing a fixed graph H as a minor has the Erdos-P\'osa property if and only if H is planar. We show that this is no longer true for the edge version of the Erdos-P\'osa property, and indeed even fails when H is an arbitrary subcubic tree of large pathwidth or a long ladder. This answers a question of Raymond, Sau and Thilikos.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…