Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, May 28, 2020, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Hung Hoang
In the combinatorial setting, a triangulation is a maximal planar graph. The concerned flip graph has the triangulations of n points as vertices, and two triangulations are adjacent if one can be transformed into the other by an edge flip. It has been known that the flip graph is connected (Wagner, 1936) and that its diameter is between 7n/3 (Frati, 2015) and 5n (Cardinal, Hoffmann, Kusters, Tóth, Wettstein, 2016). In this talk, I will present an attempt to close this gap between the bounds of the diameter and some new results on the degrees of the flip graph.
This is based on the master's thesis by Giovanni Compagnoni, supervised by Michael Hoffmann and me.
Automatic MiSe System Software Version 1.4803M | admin login