Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2512.22865 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Sommario:
- In an undirected graph, the odd cycle packing number is the maximum number of pairwise vertex-disjoint odd cycles. The odd cycle transversal number is the minimum number of vertices that hit every odd cycle. The maximum ratio between transversal and packing number is called Erdős-Pósa ratio. We show that in planar graphs, this ratio does not exceed 4. This improves on the previously best known bound of 6 by Král', Sereni and Stacho.