Raphael Steck

collaborators

4 papers

math.CO2023

Connectivity of graphs that do not have the edge-Erdős-Pósa property

Raphael Steck

We show that we can assume graphs that do not have the edge-Erdős-Pósa property to be connected. Then we strengthen this result to $2$ -connectivity under the additional assumptions…

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.CO2020

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

Raphael Steck, Arthur Ulmer

We prove that the ladder with $3$ ~rungs and the house graph have the edge-Erdős-Pósa property, while ladders with $14$ ~rungs or more have not. Additionally, we prove that the latte…