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: Tuesday, November 21, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Stefan Felsner (TU Berlin)

Triangle Flip Graphs of Arrangements of Pseudolines and Pseudocircles

We consider triangle flips in arrangements. For simple Euclidean arrangements of n pseudolines it is known that there are at least n-2 triangles. We show that the connectivity of the flip graph equals its minimum degree. For the proof we introduce the class of shellable line arrangements, which serve as destination objects for the construction of disjoint paths. Shellable arrangements are elements of flip graphs of line arrangements which are the vertices of a polytope These polytopes form clusters of good connectivity in the flip graph of pseudolines. In the case of intersecting arrangements of pseudocircles we discuss the number of triangles. Finally we show that the triangle flip graph is connected. In the proof cylindrical intersecting arrangements of pseudocircles play a special role.

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