Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 28, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Hung Hoang

Flip Graph of Combinatorial Triangulations

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login