Teresa Hoekstra Mendoza, CIMAT
 
Configuration spaces of graphs

Time: Monday, Nov 13th, 11:00am

Abstract: Given any topological space, in particular a graph G, we can define its (ordered) configuration space on n points as follows. Consider the product GxGx...xG n times and remove every tuple in which two or more entries are the same. In this talk I shall give a few examples of configuration spaces of graphs on two points, and a description of the homotopy type of the 1-skeleton of configuration spaces of trees on n points. I will also mention no k-equal spaces, which are like configuration spaces but instead of removing all tuples in which two or more entries are the same, we only remove tuples in which k or more entries are the same for k <n.