The interlace polynomial of graphs at -1

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

doi:10.1006/eujc.2002.0602

The interlace polynomial of graphs at -1

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

Mathematics

Research output: Contribution to journal › Article › peer-review

25 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 ±2^s. We also give a description of the graphs for which s is maximal.

Original language	English
Pages (from-to)	761-767
Number of pages	7
Journal	European Journal of Combinatorics
Volume	23
Issue number	7
DOIs	https://doi.org/10.1006/eujc.2002.0602
State	Published - Oct 2002

Access to Document

10.1006/eujc.2002.0602

Cite this

@article{3900c6d2aa3b4c979b44e60144445523,

title = "The interlace polynomial of graphs at -1",

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.",

author = "Balister, \{P. N.\} and B. Bollob{\'a}s and J. Cutler and L. Pebody",

year = "2002",

month = oct,

doi = "10.1006/eujc.2002.0602",

language = "English",

volume = "23",

pages = "761--767",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "7",

}

TY - JOUR

T1 - The interlace polynomial of graphs at -1

AU - Balister, P. N.

AU - Bollobás, B.

AU - Cutler, J.

AU - Pebody, L.

PY - 2002/10

Y1 - 2002/10

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/10644246806

U2 - 10.1006/eujc.2002.0602

DO - 10.1006/eujc.2002.0602

M3 - Article

AN - SCOPUS:10644246806

SN - 0195-6698

VL - 23

SP - 761

EP - 767

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 7

ER -

The interlace polynomial of graphs at -1

Abstract

Access to Document

Other files and links

Fingerprint

Cite this