Arthur Ulmer

activity

20182026

most citedErdős-Pósa from ball packing

2 citations · 6 across the 7 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 2 cited

Erdős-Pósa from ball packing

Wouter Cames van Batenburg, Gwenaël Joret, Arthur Ulmer

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 lo g k)$ vertices meeting all its cycles. While the standa…

math.CO2019★ 1 cited

Long $A$ - $B$ -paths have the edge-Erd\H os-Pósa property

Matthias Heinlein, Arthur Ulmer

For a fixed integer $ℓ$ a path is long if its length is at least $ℓ$ . We prove that for all integers $k$ and $ℓ$ there is a number $f (k, ℓ)$ such that for every graph $G…

Erdős-Pósa from ball packing

Long A-B-paths have the edge-Erd\H os-Pósa property

Long $A$ - $B$ -paths have the edge-Erd\H os-Pósa property