The Interlace Polynomial of Graphs At -1

Authors

P. N. Balister, University of Memphis
B. Bollobás, University of Cambridge
Jonathan Cutler, Montclair State UniversityFollow
Luke Pebody, University of Memphis

Document Type

Article

Publication Date

1-1-2002

Journal / Book Title

European Journal of Combinatorics

Abstract

In this paper we give an explicit formula for the interlace polynomial at x = -1 for any graph, and as a result prove a conjecture of Arratia et al. that states that it is always of the form ±2s. We also give a description of the graphs for which s is maximal.

DOI

10.1006/eujc.2002.0602

MSU Digital Commons Citation

Balister, P. N.; Bollobás, B.; Cutler, Jonathan; and Pebody, Luke, "The Interlace Polynomial of Graphs At -1" (2002). Department of Mathematics Facuty Scholarship and Creative Works. 171.
https://digitalcommons.montclair.edu/mathsci-facpubs/171

Published Citation

Balister, P. N., Bollobás, B., Cutler, J., & Pebody, L. (2002). The interlace polynomial of graphs at− 1. European Journal of Combinatorics, 23(7), 761-767.