arXiv subjects
Publications and source records attributed to Raphael Steck.
We show that we can assume graphs that do not have the edge-Erd\H{o}s-P\'{o}sa property to be connected. Then we strengthen this result to $2$-connectivity under the additional assumptions of a minor-closed property and a generic counterexample.
We show that subcubic graphs of treewidth at least $2500$ do not have the edge-Erd\H{o}s-P\'{o}sa property.
We show that walls of size at least $6 \times 4$ do not have the edge-Erd\H{o}s-P\'{o}sa property.
We prove that the ladder with $3$~rungs and the house graph have the edge-Erd\H{o}s-P\'{o}sa property, while ladders with $14$~rungs or more have not. Additionally, we prove that the latter bound is optimal in the sense that the only known counterexample graph does not permit a better result.