Das Seminar findet vom 15. bis 17. Juli in der Jugendherberge Wandlitz statt.
Das Seminar wird von der Arbeitsgruppe unterstützt, insbesondere von
Helena Bergold, Manfred Scheucher, Felix Schröder und Sandro Roch.
A flip is a local change which maps a combinatorial structure into another.
Flip-graphs have the structures as vertices and the flips as edges. The figure on this page shows the flip-graph
of acyclic orientations of the 4-cycle - you may enjoy verifying this.
Flips and flip-graphs are omnipresent in discrete mathematics, for example they are implicitly used in
gray-codes, reconfiguration problems, combinatorial markov chains and some enumeration algorithms.
Some instances of flip-graphs, however, have receives a lot of attention in their own right. Here
are three examples: (1) The flip-graph of adjacent transpositions of permutations is the skeleton graph
of the permutahedron and the cover graph of the weak Bruhat order. (2) The flip-graph of rotations of binary trees
is the skeleton graph of the associahedron and also the flip-graph of triangulations of points in convex position.
(3) The flip-graphs of triangulations of other point sets still hold a lot of secrets.
In this seminar we want to look at selected papers to learn about the many colorful faces of
flips and flip-graphs.