Matthias Heinlein

activity

20162019

most citedLong

A

B

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

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

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 $H$ as a minor has the Erdős-Pósa property if and only if $H$ is planar. We show that this is no…

math.CO2018

$K_{4}$ -subdivisions have the edge-Erdős-Pósa property

Henning Bruhn, Matthias Heinlein

We prove that every graph $G$ contains either $k$ edge-disjoint $K_{4}$ -subdivisions or a set $X$ of at most $O (k^{8} lo g k)$ edges such that $G - X$ does not contain any $K_{4}$ -subdivis…

math.CO2018

Directed cycles have the edge-Erd\H os-Pósa property

Matthias Heinlein, Arthur Ulmer

In this short note we prove that for every $k \in N$ there is a $t_{k} \in N$ such that for every digraph $G$ there are either $k$ edge-disjoint directed cycles in $G$ …

The edge-Erdős-Pósa property

K4​-subdivisions have the edge-Erdős-Pósa property

Directed cycles have the edge-Erd\H os-Pósa property

$K_{4}$ -subdivisions have the edge-Erdős-Pósa property