1 problem
- 0 votes0 replies0 views
Colorability implies bounded-degree disconnectedness of graph homomorphism spaces
Let be a graph that is -colorable. For a finite graph , let denote the space of graph homomorphisms from to , with adjacency given by changing one…