2000 character limit reached
Irreducible triangulations of surfaces with boundary
Published 28 Mar 2011 in math.CO and cs.DM | (1103.5364v2)
Abstract: A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of vertices of an irreducible triangulation of a (possibly non-orientable) surface of genus g>=0 with b>=0 boundaries is O(g+b). So far, the result was known only for surfaces without boundary (b=0). While our technique yields a worse constant in the O(.) notation, the present proof is elementary, and simpler than the previous ones in the case of surfaces without boundary.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.