Title: Hamiltonicity in acyclic orientation graphs
Abstract: Given a graph G, we are interested in enumerating all possible acyclic orientations of G by use of a Gray code, i.e. an enumeration where the change between two subsequent elements is small in some sense. In the case of graph orientation, this small change is an edge flip. This can be modelled through the corresponding graphic hyperplane arrangement or zonotope. There has been some recent progress pertaining to which graphs admit such a Gray code, i.e. which graphs admit a Hamiltonian cycle on their acyclic orientations graph. This talk gives an introduction to this topic and recent developments for this question with a focus on which graph operations preserve this Hamiltonicity property. The latter is joint work with Germain Poullot (Osnabrück).
The advanced seminar begins at 4:00 pm s.t..