On Counting Generalized Colorings
It is well known that the number of proper k-colorings of a graph is a polynomial in k. We investigate in this talk under what conditions a numeric graph invariant which is parametrized with parameters k1, ..., km is a polynomial in these parameters. We give a sufficient conditions for this to happen which is general enough to encompass all the graph polynomials which are definable in Second Order Logic. This not only covers the various generalizations of the Tutte polynomials, Interlace polynomials, Matching polynomials, but allows us to identify new graph polynomials related to combinatorial problems discussed in the literature.
Unable to display preview. Download preview PDF.
- [Big93]Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)Google Scholar
- [Bol99]Bollobás, B.: Modern Graph Theory. Springer, Heidelberg (1999)Google Scholar
- [CGM07]Courcelle, B., Godlin, B., Makowsky, J.A.: Towards a theory of graph polynomials, I: Second order definable polynomials (in preparation, 2007)Google Scholar
- [Cou]Courcelle, B.: A multivariate interlace polynomial (December 2006) (preprint)Google Scholar
- [Edw97]Edwards, K.: The harmonious chromatic number and the achromatic number. In: Bailey, R.A. (ed.) Survey in Combinatorics. London Math. Soc. Lecture Note Ser, vol. 241, pp. 13–47. Cambridge Univ. Press, Cambridge (1997)Google Scholar
- [LMST07]Linial, N., Matoušek, J., Sheffet, O., Tardos, G.: Graph coloring with no large monochromatic components (2007) arXiv:math/0703362v1Google Scholar
- [MZ06]Makowsky, J.A., Zilber, B.: Polynomial invariants of graphs and totally categorical theories. MODNET Preprint No. 21 (2006), http://www.logique.jussieu.fr/modnet/Publications/Preprint%20server
- [Sok05]Sokal, A.: The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In: Survey in Combinatorics, 2005. London Mathematical Society Lecture Notes, vol. 327, pp. 173–226 (2005)Google Scholar