On the Edge-Erdős–Pósa Property of Ladders

期刊论文
出版模式：

开放获取
发表日期：

2024年4月5日

查看全文

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 latter bound is optimal in the sense that the only known counterexample graph does not permit a better result.