Journal of Combinatorial Theory Series B
The large deviation principle for the Erdős-Rényi random graph
European Journal of Combinatorics
On the number of B-flows of a graph
European Journal of Combinatorics
Hi-index | 0.00 |
We study generalizations of the “contraction-deletion” relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman at al [Reflection positivity, rank connectivity, and homomorphisms of graphs, J. Amer. Math. Soc. 20 (2007), 37–51.] Graph algebras are defined by a graph parameter, and they were introduced in order to study and characterize homomorphism functions. We prove that for homomorphism functions, these graph algebras have special elements called “contractors” and “connectors”. This gives a new characterization of homomorphism functions. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 11–30, 2009