reciprocity formula for f_G

Tags: #theorem

Statement

Let G be a simple graph, and G¯ is its complement, fG is the function f_G (graph). Then,

fG¯(x)=(1)n1fG(xn)

where n is the number of vertices of G

Proof

Similar to that of Cayley's formula#Proof 1 induction. We define the more general function

FG(x,x1,,xn)=T spans G+xdegT(0)1i=1nxidegT(i)1

We shall show via inducting on the number of vertices that

FG¯(x,x1,,xn)=(1)n1FG(xn,x1,,xn)

One can show that this is true when xi=0, which kills everything except the trees such that vertex i is a leaf. We may then remove it and apply the inductive hypothesis.

Furthermore, the degree of both sides are less than n1, and so we may conclude via this lemma that the difference is identically 0.