New upper bound fvs_g(n) ≤ (n-2)/(g-2) via a planar-digraph cycle packing theorem, plus explicit constructions, narrows the asymptotic density gap for g ≥ 4.
Ak 2i−1) are identified with vertices of layer 45 0 of the blockBa 2i (resp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Feedback vertex sets of planar digraphs with fixed digirth
New upper bound fvs_g(n) ≤ (n-2)/(g-2) via a planar-digraph cycle packing theorem, plus explicit constructions, narrows the asymptotic density gap for g ≥ 4.