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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, December 14, 2021, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Hung Hoang

For a drawing of a labeled graph, the rotation of a vertex is the cyclic order of its incident edges, presented by the labels of their other endpoints. The rotation system of the drawing is the collection of the rotations of all vertices. A drawing is simple if each pair of edges has at most one common point. Gioan's Theorem states that for any two simple drawings of the complete graph K_{n} with the same rotation system, we can transform one drawing into the other by a sequence of triangle flips. Intuitively, this operation refers to the act of moving one edge of a triangular cell formed by three pairwise crossing edges over the opposite vertex of the cell.

In this talk, I will present the generalization of Gioan's Theorem to complete bipartite graphs K_{m,n}. This holds when the two drawings share the same extended rotation system. This notion extends the rotation system to include also the rotations around crossings. Note that the theorem does not hold if the graph is slightly sparser: For a family of graphs where we remove two edges from K_{m,n}, we can show that there exist two simple drawings that cannot be transformed into each other via triangle flips.

Joint work with Oswin Aichholzer, Man-Kwun Chiu, Michael Hoffmann, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger

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