19 citations · 41 across the 26 of their papers we have counts for
4 papers · 1 filter
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…
Packing A-Paths of Length Zero Modulo Four
Henning Bruhn, Arthur Ulmer
We show that A-paths of length 0 modulo 4 have the Erdős-Pósa property. We also prove that A-paths of length 2 modulo 4 have the property but that A-paths of length 1 or of length…
Erdős-Pósa property for labelled minors: 2-connected minors
Henning Bruhn, Felix Joos, Oliver Schaudt
In the 1960s, Erdős and Pósa proved that there is a packing-covering duality for cycles in graphs. As part of the graph minor project, Robertson and Seymour greatly extended this:…