English

Small feedback vertex sets in planar digraphs

Combinatorics 2017-04-18 v3

Abstract

Let GG be a directed planar graph on nn vertices, with no directed cycle of length less than g4g\ge 4. We prove that GG contains a set XX of vertices such that GXG-X has no directed cycle, and X5n59|X|\le \tfrac{5n-5}9 if g=4g=4, X2n54|X|\le \tfrac{2n-5}4 if g=5g=5, and X2n6g|X|\le \tfrac{2n-6}{g} if g6g\ge 6. This improves recent results of Golowich and Rolnick.

Keywords

Cite

@article{arxiv.1606.04419,
  title  = {Small feedback vertex sets in planar digraphs},
  author = {Louis Esperet and Laetitia Lemoine and Frédéric Maffray},
  journal= {arXiv preprint arXiv:1606.04419},
  year   = {2017}
}

Comments

5 pages, 1 figure - v3 final version

R2 v1 2026-06-22T14:25:07.340Z