English

Faces in girth-saturated graphs on surfaces

Combinatorics 2025-05-20 v3

Abstract

What is the maximum length fmax(,Σ){\rm f}_{\rm max}(\ell, \Sigma) of a facial cycle of an inclusion-maximal graph with girth at least \ell embedded on a given surface Σ\Sigma? If Σ=P\Sigma=\mathcal{P} is a plane, we show that 311fmax(,P)8133\ell-11\leq {\rm f}_{\rm max}(\ell, \mathcal{P})\leq 8\ell-13. We also prove that fmax(,Σ){\rm f}_{\rm max}(\ell, \Sigma) is bounded for any integer \ell and any closed surface Σ\Sigma. For a fixed Σ\Sigma, we show that Ω()=fmax(,Σ)=O(2)\Omega(\ell) ={\rm f}_{\rm max}(\ell, \Sigma) = O(\ell^2), while for a fixed 6\ell\ge 6, fmax(,Σ)=Θ(g){\rm f}_{\rm max}(\ell, \Sigma)=\Theta(g), where gg is the genus of Σ\Sigma.

Cite

@article{arxiv.2410.13481,
  title  = {Faces in girth-saturated graphs on surfaces},
  author = {Maria Axenovich and Leon Kießle and Arsenii Sagdeev and Maksim Zhukovskii},
  journal= {arXiv preprint arXiv:2410.13481},
  year   = {2025}
}

Comments

16 pages, 22 figures; major revision: improved upper bound for closed surfaces

R2 v1 2026-06-28T19:25:45.073Z