53rd Southeastern International Conference on Combinatorics, Graph Theory & Computing

March 7-11, 2022

Special Sessions:

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.

Please forward abstracts to Bryan Curtis and to cgtc53@fau.edu.

 

Title:  Matroids and  Rigidity Theory

Organizers: Daniel Irving Bernstein and Zvi Rosen

 One of the most fundamental questions in rigidity theory asks: is a given physical construction of a graph in d-dimensional space rigid, when the edges are rigid bars that are free to move around their incident vertices? The graphs for which the answer is "yes" (assuming a generic placement of vertices) are the spanning set of a matroid. As a result, matroids are an important tool in rigidity theory. This session will feature talks on rigidity theory and matroid theory with the goal of deepening connections between the two fields.


Please forward abstracts to cgtc53@fau.edu.