id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
9s161546c7g	John Engbers	Some problems involving H-colorings of graphs	2013		.txt	text/plain	390	11	58	Writing hom(G, H ) for the number of H -colorings of G, we show that for δ = 1 and δ = 2 and fixed H , hom(G, H ) ≤ max{hom(Kδ+1, H ) n/δ+1 , hom(Kδ,δ, H ) 2δ , hom(Kδ,n−δ, H )} for any n vertex minimum degree δ graph G (for sufficiently large n). H -colorings generalize such graph theory notions as proper colorings and independent sets.	cache/9s161546c7g.txt	txt/9s161546c7g.txt