Highly Influenced

# Complexes of Graph Homomorphisms

@inproceedings{Kozlov1984ComplexesOG, title={Complexes of Graph Homomorphisms}, author={Dmitry N. Kozlov}, year={1984} }

- Published 1984

Hom (G, H) is a polyhedral complex defined for any two undirected graphs G and H. This construction was introduced by Lovász to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological properties of this class of complexes. We show that Hom (K2, Kn) is a boundary complex of a polytope, on which the natural Z2-action on the first argument, induces an antipodal action. We prove that Hom (Km, Kn) is homotopy equivalent to a wedge of (n − m… CONTINUE READING

#### From This Paper

##### Topics from this paper.

38 Citations

7 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-7 of 7 references