Faces in girth-saturated graphs on surfaces
Combinatorics
2025-05-20 v3
Abstract
What is the maximum length of a facial cycle of an inclusion-maximal graph with girth at least embedded on a given surface ? If is a plane, we show that . We also prove that is bounded for any integer and any closed surface . For a fixed , we show that , while for a fixed , , where is the genus of .
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