Hom complexes and homotopy theory in the category of graphs
Anton Dochtermann
Abstract
We investigate a notion of ×-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph ×-homotopy is characterized by the topological properties of the complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; complexes were introduced by Lovász and further studied by Babson and Kozlov to give topological bounds on chromatic number. Along the way, we also establish some structural properties of complexes involving products and exponentials of graphs, as well as a symmetry result which can be used to reprove a theorem of Kozlov involving foldings of graphs. Graph ×-homotopy naturally leads to a notion of homotopy equivalence which we show has several equivalent characterizations. We apply the notions of ×-homotopy equivalence to the class of dismantlable graphs to get a list of conditions that again characterize these. We end with a discussion of graph homotopies arising from other internal homs, including the construction of `A-theory' associated to the cartesian product in the category of reflexive graphs.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.