Hostname: page-component-7f64f4797f-7vssv Total loading time: 0 Render date: 2025-11-03T22:00:07.070Z Has data issue: false hasContentIssue false
  • English
  • Français

The Equivalence of Two Graph Polynomials and a Symmetric Function

Published online by Cambridge University Press:  01 July 2009

CRIEL MERINO  and
STEVEN D. NOBLE
CRIEL MERINO
Affiliation:
Instituto de Matemáticas, Universidad Nacional Autónoma de México, Area de la Investigación Científica, Circuito Exterior, CU Coyoacán 04510, México, DF México (e-mail: merino@matem.unam.mx)
STEVEN D. NOBLE
Affiliation:
Department of Mathematical Sciences, Brunel University, Kingston Lane, Uxbridge, UB8 3PH, UK (e-mail: steven.noble@brunel.ac.uk)
Get access Rights & Permissions [Opens in a new window]

Abstract

The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial, due to Stanley, are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the coefficients of any other. The definition of each of these functions suggests a natural way in which to strengthen them, which also captures Tutte's universal V-function as a specialization. We show that the equivalence remains true for the strong functions, thus answering a question raised by Dominic Welsh.

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 18 , Issue 4 , July 2009 , pp. 601 - 615
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1]Birkhoff, G. D. (1912) A determinant formula for the number of ways of coloring a map. Ann. of Math. 14 42–46.CrossRefGoogle Scholar
[2]Bollobás, B. and Riordan, O. (2000) Polychromatic polynomials. Discrete Math. 219 1–7.CrossRefGoogle Scholar
[3]Brylawski, T. H. (1981) Intersection theory for graphs. J. Combin. Theory Ser. B 30 233–246.CrossRefGoogle Scholar
[4]Brylawski, T. H. and Oxley, J. G. (1992) The Tutte polynomial and its applications. In Matroid Applications (White, N., ed.), Cambridge University Press, Cambridge, pp. 123–225.CrossRefGoogle Scholar
[5]Chmutov, S. V., Duzhin, S. V. and Lando, S. K. (1994) Vassiliev knot invariants I: Introduction. Adv. Soviet Math. 21 117–126.Google Scholar
[6]Chmutov, S. V., Duzhin, S. V. and Lando, S. K. (1994) Vassiliev knot invariants II: Intersection graph for trees. Adv. Soviet Math. 21 127–134.Google Scholar
[7]Chmutov, S. V., Duzhin, S. V. and Lando, S. K. (1994) Vassiliev knot invariants III: Forest algebra and weighted graphs. Adv. Soviet Math. 21 135–145.Google Scholar
[8]Farr, G. E. (1993) A correlation inequality involving stable sets and chromatic polynomials. J. Combin. Theory Ser. B 58 14–21.CrossRefGoogle Scholar
[9]MacDonald, I. G. (1979) Symmetric Functions and Hall Polynomials, Oxford Mathematical Monographs, Oxford University Press, New York.Google Scholar
[10]Makowsky, J. A. (2008) From a zoo to a zoology: Towards a general theory of graph polynomials. Theory Comput. Syst. 43 542–562.CrossRefGoogle Scholar
[11]Noble, S. D. and Welsh, D. J. A. (1999) A weighted graph polynomial from chromatic invariants of knots. Ann. Inst. Fourier 49 1057–1087.CrossRefGoogle Scholar
[12]Oxley, J. G. and Whittle, G. P. (1993) Tutte invariants for 2-polymatroids. In Graph Structure Theory (Robertson, N. and Seymour, P. D., eds), Vol. 147 of Contemporary Mathematics, AMS, pp. 9–19.CrossRefGoogle Scholar
[13]Sarmiento, I. (2000) The polychromate and a chord diagram polynomial. Ann. Combin. 4 227–236.CrossRefGoogle Scholar
[14]Stanley, R. P. (1995) A symmetric function generalization of the chromatic polynomial of a graph. Adv. Math. 111 166–194.CrossRefGoogle Scholar
[15]Stanley, R. P. (1998) Graph colorings and related symmetric functions: Ideas and applications. A description of results, interesting applications, & notable open problems. Discrete Math. 193 267–286.CrossRefGoogle Scholar
[16]Tutte, W. T. (1947) A ring in graph theory. Math. Proc. Cambridge Philos. Soc. 43 26–40.CrossRefGoogle Scholar
[17]Welsh, D. J. A. (1993) Complexity: Knots, Colourings, and Counting, Vol. 186 of London Mathematical Society Lecture Notes, Cambridge University Press, Cambridge.CrossRefGoogle Scholar
[18]Welsh, D. J. A. (2005). Graph polynomials: Some questions. Talk at Annual One-Day Combinatorics Colloquium, Reading.Google Scholar
[19]Whitney, H. (1932) The coloring of graphs. Ann. of Math. 33 688–718.CrossRefGoogle Scholar