Reconfigurations of Plane Caterpillars and Paths

I will introduce notion of combinatorial reconfiguration and reconfiguration graphs and their importance in computer science. We will then briefly look at some interesting examples of reconfigurations in computer science and geometry and the relationship between them. After that I will focus on reconfigurations of plane spanning trees and particularly how these reconfigurations behave when our trees are restricted to be just caterpillars or just paths. I will show some results regarding the connectivity of these reconfiguration graphs and if time permits one or two proofs.

This is joint work with Guillermo Gamboa Quintero and Jelena Glišić