Counting Graph Homomorphisms
- Christian Borgs ,
- Jennifer Chayes ,
- Laszlo Lovasz ,
- Vera T. Sos ,
- Katalin Vesztergombi
in Topics in Discrete Mathematics
Published by Springer | 2006
M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas, P. Valtr
For two finite graphs G and H, let hom(G;H) denote the number of homomorphisms (adjacency-preserving mappings) from G to H. Counting homomorphisms between graphs has many interesting aspects.