Conférencier: Nicolas Bousquet (CNRS, université Claude Bernard Lyon 1, France)

Configuration graphs are "meta-graphs" where vertices are solutions of a problem and two solutions are linked by an edge if one can be transformed into the other into a "canonical" step. These questions naturally arise in many fields from discrete geometry to combinatorial optimization.The goal of this introductory talk is to present (some of) these problems and their motivations, discuss some recent results on the topic and mention some open problems in the area.