Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colorings. We show that folding in the second parameter of the homomorphism complex yields a homotopy equivalence. We study how the Mycielski construction changes the homotopy type of the homomorphism complex. We construct graphs showing that the topological bound obtained by odd cycles can be arbitrarily worse than the bound provided by Hom(K_2,G)
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Thesis (Ph. D.)--University of Washington, 2007.In this thesis we consider topological aspects of gr...
AbstractWe investigate a notion of ×-homotopy of graph maps that is based on the internal hom associ...
AbstractIn this paper we provide concrete combinatorial formal deformation algorithms, namely sequen...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Homomorphism complexes were introduced by Lov\'asz to study topological obstructions to graph colori...
Thesis (Ph. D.)--University of Washington, 2007.In this thesis we consider topological aspects of gr...
AbstractWe investigate a notion of ×-homotopy of graph maps that is based on the internal hom associ...
AbstractIn this paper we provide concrete combinatorial formal deformation algorithms, namely sequen...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
In [14] Matoušek and Ziegler compared various topological lower bounds for the chromatic number. The...
This is a book about graph homomorphisms. Graph theory is now an established discipline but the stud...