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.
|Number of pages||7|
|Journal||European Journal of Combinatorics|
|State||Published - Oct 2002|