Bärnkopf, Pál and Győri, Ervin (2025) Jones’ Conjecture for Halin Graphs and a Bit More. ANNALS OF COMBINATORICS. ISSN 0218-0006
|
Text
2401.07376v3.pdf - Draft Version Available under License Creative Commons Attribution. Download (237kB) | Preview |
Official URL: https://doi.org/10.1007/s00026-025-00800-y
Abstract
We prove Jones’ famous conjecture for Halin graphs and a somewhat more general class of graphs, too. A based planar graph is a planar one that has a face adjacent to every other face. We confirm Jones’ conjecture for based planar graphs. Namely, if a based planar graph does not contain k + 1 vertexdisjoint cycles, then it suffices to delete 2k vertices to make it acyclic.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Jones’ conjecture, planar graph, cycle packing, feedback vertex set |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 01 Apr 2026 08:45 |
| Last Modified: | 01 Apr 2026 08:45 |
| URI: | https://real.mtak.hu/id/eprint/236613 |
Actions (login required)
 |
Edit Item |
