Abstract
The number of homomorphisms hom(G, K k ) from a graph G to the complete graph K k is the value of the chromatic polynomial of G at a positive integer k.
Partially supported by JA-FQM164.
Supported by CE-ITI P202/12/G061, and by Project ERCCZ LL1201 Cores.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2013 Scuola Normale Superiore Pisa
About this paper
Cite this paper
Garijo, D., Goodall, A.J., Nešetřil, J. (2013). Polynomial graph invariants from homomorphism numbers. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_97
Download citation
DOI: https://doi.org/10.1007/978-88-7642-475-5_97
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-474-8
Online ISBN: 978-88-7642-475-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)