Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2003.03236 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914751385174016 |
|---|---|
| author | Steck, Raphael Ulmer, Arthur |
| author_facet | Steck, Raphael Ulmer, Arthur |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2003_03236 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | On the edge-Erdős-Pósa property of Ladders Steck, Raphael Ulmer, Arthur Combinatorics 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. |
| title | On the edge-Erdős-Pósa property of Ladders |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2003.03236 |