Face sizes and the connectivity of the dual
Combinatorics
2023-11-01 v2
Abstract
For each we prove tight lower bounds on face sizes that must be present to allow - or -cuts in simple duals of -connected maps. Using these bounds, we determine the smallest genus on which a -connected map can have a simple dual with a -cut and give lower and some upper bounds for the smallest genus on which a -connected map can have a simple dual with a -cut.
Cite
@article{arxiv.2309.17121,
title = {Face sizes and the connectivity of the dual},
author = {Gunnar Brinkmann and Kenta Noguchi and Heidi Van den Camp},
journal= {arXiv preprint arXiv:2309.17121},
year = {2023}
}
Comments
19 pages, 11 figures