Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces
Éric Colin de Verdière, Alfredo Hubard, Arnaud de Mesmay · 2014
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart).