id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
jd472v26441	Justin Mathew Hilyard	Various Results on Enumerations of Graph Homomorphisms	2014		.txt	text/plain	346	12	47	Many graph notions can be described using graph homomorphisms, including independent sets, matchings, and graph colorings. Finally, we present a q-weighted enumeration of matchings of complete bipartite graphs, an enumeration which was key to proving the validity of a new combinatorial interpretation of the q-analog of a generalization of the Stirling numbers of the second kind in work with Engbers and Galvin [20].	cache/jd472v26441.txt	txt/jd472v26441.txt