2000 character limit reached
The edge-Erdős-Pósa property
Published 28 Sep 2018 in math.CO | (1809.11038v1)
Abstract: Robertson and Seymour proved that the family of all graphs containing a fixed graph $H$ as a minor has the Erd\H{o}s-P\'osa property if and only if $H$ is planar. We show that this is no longer true for the edge version of the Erd\H{o}s-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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.