2 citations · 4 across the 6 of their papers we have counts for
7 papers
Even -cycles have the edge-Erdős-Pósa property
Henning Bruhn
I prove that even -cycles have the edge-Erdős-Pósa property.
Long --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 and there is a number such that for every graph $G…
The edge-Erdős-Pósa property
Henning Bruhn, Matthias Heinlein, Felix Joos
Robertson and Seymour proved that the family of all graphs containing a fixed graph as a minor has the Erdős-Pósa property if and only if is planar. We show that this is no…
-subdivisions have the edge-Erdős-Pósa property
Henning Bruhn, Matthias Heinlein
We prove that every graph contains either edge-disjoint -subdivisions or a set of at most edges such that does not contain any -subdivis…
Directed cycles have the edge-Erd\H os-Pósa property
Matthias Heinlein, Arthur Ulmer
In this short note we prove that for every there is a such that for every digraph there are either edge-disjoint directed cycles in …
Frames, -paths and the Erdős-Pósa property
Henning Bruhn, Matthias Heinlein, Felix Joos
A key feature of Simonovits' proof of the classic Erdős-Pósa theorem is a simple subgraph of the host graph, a frame, that determines the outcome of the theorem. We transfer this f…
Long cycles have the edge-Erdős-Pósa property
Henning Bruhn, Matthias Heinlein, Felix Joos
We prove that the set of long cycles has the edge-Erdős-Pósa property: for every fixed integer and every , every graph either contains edge-disj…