Irreducible Triangulations are Small
Combinatorics
2011-05-19 v2
Abstract
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus has at most vertices. The best previous bound was .
Cite
@article{arxiv.0907.1421,
title = {Irreducible Triangulations are Small},
author = {Gwenaël Joret and David R. Wood},
journal= {arXiv preprint arXiv:0907.1421},
year = {2011}
}
Comments
v2: Referees' comments incorporated