Balanced triangulations on few vertices

  • Lorenzo Venturello (Universität Osnabrück, Osnabrück, Germany)
E1 05 (Leibniz-Saal)


A classical problem in combinatorial and computational topology asks for the minimum number of vertices needed to triangulate a certain manifold. In this talk I will focus on the family of balanced simplicial complexes, that is d-dimensional complexes whose underlying graph is (d+1)-colorable, and I will exhibit balanced triangulations of surfaces and 3-manifolds on few vertices which are the result of an implementation of local flips preserving the coloring condition.


Saskia Gutzschebauch

Max-Planck-Institut für Mathematik in den Naturwissenschaften Contact via Mail

Tim Seynnaeve

Max Planck Institute for Mathematics in the Sciences, Leipzig

Rodica Dinu

University of Bucharest

Giulia Codenotti

Freie Universität Berlin

Frank Röttger

Otto-von-Guericke-Universität, Magdeburg