Erdős-Pósa from ball packing

A classic theorem of Erdős and Pósa (1965) states that every graph has either k vertex-disjoint cycles or a set of O(k log k) vertices meeting all its cycles. We give a new proof of this theorem using a ball packing argument of Kühn and Osthus (2003). This approach seems particularly well suited for studying edge variants of the Erdős-Pósa theorem. As an illustration, we give a short proof of a theorem of Bruhn, Heinlein, and Joos (2019), that cycles of length at least ℓ have the so-called edge-Erdős-Pósa property. More precisely, we show that every graph G either contains k edge-disjoint cycles of length at least ℓ or an edge set F of size O(kℓ·log (kℓ)) such that G-F has no cycle of length at least ℓ. For fixed ℓ, this improves on the previously best known bound of O(k^2 log k +kℓ).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2021

On the Erdős-Pósa property for long holes in C_4-free graphs

We prove that there exists a function f(k)=𝒪(k^2 log k) such that for ev...
research
07/04/2019

Packing directed circuits quarter-integrally

The celebrated Erdős-Pósa theorem states that every undirected graph tha...
research
02/20/2018

The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments

Given a directed graph D on n vertices and a positive integer k, the Arc...
research
06/12/2020

On Packing Low-Diameter Spanning Trees

Edge connectivity of a graph is one of the most fundamental graph-theore...
research
07/09/2021

Adaptable and conflict colouring multigraphs with no cycles of length three or four

The adaptable choosability of a multigraph G, denoted ch_a(G), is the sm...
research
08/25/2018

A short exposition of S. Parsa's theorem on intrinsic linking and non-realizability

We present a short statement and proof of the following result by S. Par...
research
08/25/2018

A short exposition of S. Parsa's theorems on intrinsic linking and non-realizability

We present a short exposition of the following results by S. Parsa. Le...

Please sign up or login with your details

Forgot password? Click here to reset