Back to Search Start Over

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

Authors :
Steck, Raphael
Ulmer, Arthur
Source :
Graphs & Combinatorics. May2024, Vol. 40 Issue 3, p1-35. 35p.
Publication Year :
2024

Abstract

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. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09110119
Volume :
40
Issue :
3
Database :
Academic Search Index
Journal :
Graphs & Combinatorics
Publication Type :
Academic Journal
Accession number :
176483577
Full Text :
https://doi.org/10.1007/s00373-024-02765-w