Frames, A-paths and the Erdos-P\'osa property

Abstract

A key feature of Simonovits' proof of the classic Erdos-P\'osa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this frame technique to A-paths. With it we deduce a simple proof of Gallai's theorem, although with a worse bound, and we verify the Erdos-P\'osa property for long and for even A-paths. We also show that even A-paths do not have the edge-Erdos-P\'osa property.

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…