On the edge-Erd\H{o}s-P\'{o}sa property of Ladders
Combinatorics
2024-04-16 v5
Abstract
We prove that the ladder with ~rungs and the house graph have the edge-Erd\H{o}s-P\'{o}sa property, while ladders with ~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.
Cite
@article{arxiv.2003.03236,
title = {On the edge-Erd\H{o}s-P\'{o}sa property of Ladders},
author = {Raphael Steck and Arthur Ulmer},
journal= {arXiv preprint arXiv:2003.03236},
year = {2024}
}