The interlace polynomial of graphs at -1

P. N. Balister, B. Bollobás, J. Cutler, L. Pebody

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

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.

Original languageEnglish
Pages (from-to)761-767
Number of pages7
JournalEuropean Journal of Combinatorics
Volume23
Issue number7
DOIs
StatePublished - Oct 2002

Fingerprint Dive into the research topics of 'The interlace polynomial of graphs at -1'. Together they form a unique fingerprint.

Cite this