The interlace polynomial of graphs at -1

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

Research output: Contribution to journalArticleResearchpeer-review

23 Citations (Scopus)

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 - 1 Jan 2002

Fingerprint

Polynomial
Graph in graph theory
Explicit Formula
Form

Cite this

Balister, P. N. ; Bollobás, B. ; Cutler, Jonathan ; Pebody, L. / The interlace polynomial of graphs at -1. In: European Journal of Combinatorics. 2002 ; Vol. 23, No. 7. pp. 761-767.
@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 Jonathan Cutler and L. Pebody",
year = "2002",
month = "1",
day = "1",
doi = "10.1006/eujc.2002.0602",
language = "English",
volume = "23",
pages = "761--767",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
number = "7",

}

The interlace polynomial of graphs at -1. / Balister, P. N.; Bollobás, B.; Cutler, Jonathan; Pebody, L.

In: European Journal of Combinatorics, Vol. 23, No. 7, 01.01.2002, p. 761-767.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - The interlace polynomial of graphs at -1

AU - Balister, P. N.

AU - Bollobás, B.

AU - Cutler, Jonathan

AU - Pebody, L.

PY - 2002/1/1

Y1 - 2002/1/1

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 - http://www.scopus.com/inward/record.url?scp=10644246806&partnerID=8YFLogxK

U2 - 10.1006/eujc.2002.0602

DO - 10.1006/eujc.2002.0602

M3 - Article

VL - 23

SP - 761

EP - 767

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 7

ER -