On cycle packings and feedback vertex sets
DOI:
https://doi.org/10.11575/cdm.v9i2.62105Abstract
For a graph $G$, let $\mathbf{fvs}$ and $\mathbf{cp}$ denote the minimum size of a feedback vertex set in $G$ and the maximum size of a cycle packing in $G$, respectively. Kloks, Lee, and Liu conjectured that $\mathbf{fvs}(G)\le 2\,\mathbf{cp}(G)$ if $G$ is planar. They proved a weaker inequality, replacing $2$ by $5$. We improve this, replacing $5$ by $3$, and verifying the resulting inequality for graphs embedded in surfaces of nonnegative Euler characteristic. We also generalize to arbitrary surfaces. We show that, if a graph $G$ embeds in a surface of Euler characteristic $c\le 0$, then $\mathbf{fvs}(G)\le 3\,\mathbf{cp}(G) + 103(-c)$. Lastly, we consider what the best possible bound on $\mathbf{fvs}$ might be, and give some open problems.Downloads
Published
Issue
Section
License
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
Attribution-NoDerivs
CC BY-ND
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.