English

Face covers and rooted minors in bounded genus graphs

Combinatorics 2025-03-13 v1 Discrete Mathematics

Abstract

A {\em rooted graph} is a graph together with a designated vertex subset, called the {\em roots}. In this paper, we consider rooted graphs embedded in a fixed surface. A collection of faces of the embedding is a {\em face cover} if every root is incident to some face in the collection. We prove that every 33-connected, rooted graph that has no rooted K2,tK_{2,t} minor and is embedded in a surface of Euler genus gg, has a face cover whose size is upper-bounded by some function of gg and tt, provided that the face-width of the embedding is large enough in terms of gg. In the planar case, we prove an unconditional O(t4)O(t^4) upper bound, improving a result of B\"ohme and Mohar~\cite{BM02}. The higher genus case was claimed without a proof by B\"ohme, Kawarabayashi, Maharry and Mohar~\cite{BKMM08}.

Keywords

Cite

@article{arxiv.2503.09230,
  title  = {Face covers and rooted minors in bounded genus graphs},
  author = {Samuel Fiorini and Stefan Kober and Michał T. Seweryn and Abhinav Shantanam and Yelena Yuditsky},
  journal= {arXiv preprint arXiv:2503.09230},
  year   = {2025}
}
R2 v1 2026-06-28T22:17:22.042Z