H. Bruhn

activity

20092026

most citedAxioms for infinite matroids

19 citations · 41 across the 26 of their papers we have counts for

collaborators

Showing math.COShow all

30 papers · 1 filter

math.CO2026

Connecting vertex sets to walls

Henning Bruhn, Felix Joos, Arthur Ulmer

Menger's theorem on $A$ -- $B$ -paths and Gallai's theorem on $A$ -paths are among the most useful results in structural graph theory. Many variants and extensions are known. We add to…

math.CO2023

Subcubic graphs of large treewidth do not have the edge-Erdős-Pósa property

Raphael Steck, Henning Bruhn

We show that subcubic graphs of treewidth at least $2500$ do not have the edge-Erdős-Pósa property.

math.CO2023

On the edge-Erdős-Pósa property of walls

Henning Bruhn, Raphael Steck

We show that walls of size at least $6 \times 4$ do not have the edge-Erdős-Pósa property.

math.CO2019

Even $A$ -cycles have the edge-Erdős-Pósa property

Henning Bruhn

I prove that even $A$ -cycles have the edge-Erdős-Pósa property.

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…