Face sizes and the connectivity of the dual
Gunnar Brinkmann, Kenta Noguchi, Heidi Van den Camp

TL;DR
This paper establishes tight bounds on face sizes necessary for certain cuts in simple duals of c-connected maps, determining minimal genus conditions for these configurations.
Contribution
It provides the first tight bounds on face sizes for 1- and 2-cuts in simple duals of c-connected maps and identifies minimal genus conditions for their existence.
Findings
Tight lower bounds on face sizes for 1- and 2-cuts.
Minimal genus for c-connected maps with simple duals having 2-cuts.
Bounds for genus with 1-cuts in simple duals.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Geometric and Algebraic Topology
