| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657169 | Journal of Combinatorial Theory, Series B | 2010 | 10 Pages |
Abstract
A triangulation of a surface is 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 g⩾1 has at most 13g−4 vertices. The best previous bound was 171g−72.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
