Learn More
For given graphs G and H, let |Hom(G,H)| denote the set of graph homomorphisms from G to H. We show that for any finite, n-regular, bipartite graph G and any finite graph H (perhaps with loops),(More)
For graphs G and H, a homomorphism from G to H, or H-coloring of G, is an adjacency preserving map from the vertex set of G to the vertex set of H. Our concern in this paper is the maximum number of(More)
For graphs G and H, an H-coloring of G is a function from the vertices of G to the vertices of H that preserves adjacency. H-colorings encode graph theory notions such as independent sets and proper(More)