Face covers and rooted minors in bounded genus graphs
Abstract
A rooted graph is a graph together with a designated vertex subset, called the roots. In this paper, we consider rooted graphs embedded in a fixed surface. A collection of faces of the embedding is a face cover if every root is incident to some face in the collection. We prove that every 3-connected, rooted graph that has no rooted K2,t minor and is embedded in a surface of Euler genus g, has a face cover whose size is upper-bounded by some function of g and t, provided that the face-width of the embedding is large enough in terms of g. In the planar case, we prove an unconditional O(t4) upper bound, improving a result of B\"ohme and Mohar~BM02. The higher genus case was claimed without a proof by B\"ohme, Kawarabayashi, Maharry and Mohar~BKMM08.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.