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, December 07, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Torsten Mütze

Rainbow cycles in flip graphs

The flip graph of triangulations has as vertices all triangulations of a set of points in convex position, and an edge between any two triangulations that differ in exactly one inner edge. A rainbow cycle in this graph is a cycle in which every inner edge of the triangulation appears and disappears exactly once. This notion of a rainbow cycle extends straightforwardly also to other flip graphs of interest for computer scientists, such as the flip graphs of spanning trees or matchings on a point set, or the flip graphs of permutations or subsets on a ground set. For each of these five settings we prove the existence and non-existence of rainbow cycles for different values of the parameters.
This is joint work with Stefan Felsner, Linda Kleist and Leon Sering.

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