
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 $g\geq1$ has at most $13g-4$ vertices. The best previous bound was $171g-72$.
v2: Referees' comments incorporated
Topological graph theory, Extremal problems in graph theory, Pure Mathematics, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science, topological graph theory, Computational Theory and Mathematics, Informatique mathématique, Irreducible triangulations, FOS: Mathematics, 05C10, 05C35, irreducible triangulations, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO)
Topological graph theory, Extremal problems in graph theory, Pure Mathematics, Planar graphs; geometric and topological aspects of graph theory, Theoretical Computer Science, topological graph theory, Computational Theory and Mathematics, Informatique mathématique, Irreducible triangulations, FOS: Mathematics, 05C10, 05C35, irreducible triangulations, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
