Title: Graph Reconfiguration
Organizers: Bryan Curtis and Leslie Hogben
The study of reconfiguration examines relationships among solutions to a problem. These solutions are modeled as vertices in a graph called the reconfiguration graph. A reconfiguration rule describes the adjacency relationship in the reconfiguration graph. Reconfiguration can also be viewed as a transformation process, where the reconfiguration rule describes the allowed transformations to solutions, and reconfiguration is a sequence of transformations between solutions in which each intermediate state is also a solution. Being able to reconfigure one solution to another is equivalent to having a path between the two solutions in the reconfiguration graph, i.e., the two solutions are in the same connected component of the reconfiguration graph. Reconfiguration has been studied for graph coloring, dominating set, zero forcing set, etc. This special session will present talks on various aspects of reconfiguration.
Title: Matroid Rigidity
Organizers: Daniel Irving Bernstein and Zvi Rosen
Please forward abstracts to email@example.com.