the tutte polynomial graph polynomials 238900 winter 05/06
TRANSCRIPT
![Page 1: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/1.jpg)
The Tutte Polynomial
Graph Polynomials 238900 winter 05/06
![Page 2: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/2.jpg)
The Rank Generation Polynomial
Reminder
GEF
FnEkFk yxyxGS ,;
FkVFr
FkVFFn
Fk
Number of connected components in G(V,F)
![Page 3: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/3.jpg)
The Rank Generation Polynomial
Theorem 2
else
loop a is
bridge a is
,;/,;
,;1
,;1
,; e
e
yxeGSyxeGS
yxeGSy
yxeGSx
yxGS
eG
eG
/
Is the graph obtained by omitting edge e
Is the graph obtained by contracting edge e
In addition, S(En;x,y) = 1 for G(V,E) where |V|=n and |E|=0
![Page 4: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/4.jpg)
The Rank Generation Polynomial
Theorem 2 – ProofLet us define :
G’ = G – e G’’ = G / e
r’<G> = r<G’>n’<G> = n<G’>r’’<G> = r<G’’>n’’<G> = n<G’’>
![Page 5: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/5.jpg)
The Rank Generation Polynomial
Theorem 2 – Proof
eEeE
eFeF
Let us denote :
![Page 6: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/6.jpg)
The Rank Generation Polynomial
Observations
FrGr
FreEreFrEr
FnFn
FrFr
eEFEe
''''
''''
'
'
,
![Page 7: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/7.jpg)
The Rank Generation Polynomial
Observations
FrGr
FreEreFrEr
FnFn
FrFr
eEFEe
''''
''''
'
'
,
Fe
![Page 8: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/8.jpg)
The Rank Generation Polynomial
Observations
FrGr
FreEreFrEr
FnFn
FrFr
eEFEe
''''
''''
'
'
,
FkeFk
eEkEk
else
loop
VV
VV
1
![Page 9: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/9.jpg)
The Rank Generation Polynomial
Observations
FrGr
FreEreFrEr
FnFn
FrFr
eEFEe
''''
''''
'
'
,
''''' GG
3
![Page 10: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/10.jpg)
The Rank Generation Polynomial
Observations
else
bridge a is
'
1' e
eEr
eErEr
else
loop a is
''
1'' e
Fn
FneFn
kk
VV
EE
1
1
kk
VV
EE
1
1
2
![Page 11: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/11.jpg)
The Rank Generation Polynomial
GEF
FnEkFk yxyxGS ,;
Reminder
GEF
FnFrEr yx
![Page 12: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/12.jpg)
The Rank Generation Polynomial
yxGSyxGSyxGS ,;,;,; 10
FeGEF
FnFrEr yxyxGS,
0 ,;
FeGEF
FnFrEr yxyxGS,
1 ,;
Let us define
![Page 13: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/13.jpg)
The Rank Generation Polynomial
otherwise
bridge a is
,;
'
'''
'
''1'
,0
e
yx
yx
yx
yxyxGS
GEF
FnFreEr
GEF
FnFreEr
eEF
FnFrEr
FeGEF
FnFrEr
1
![Page 14: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/14.jpg)
The Rank Generation Polynomial
otherwise
bridge a is
,;
,;
otherwise
bridge a is
,;
'
'''
'
''1'
0
e
yxeGS
yxeGxS
e
yx
yx
yxGS
GEF
FnFreEr
GEF
FnFreEr
![Page 15: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/15.jpg)
The Rank Generation Polynomial
otherwise
loop a is
,;
''
''''''
''
1''''''
,1
e
yx
yx
yx
yxyxGS
GEF
FnFrGr
GEF
FnFrGr
eEF
eFneFrEr
FeGEF
FnFrEr
2
3
![Page 16: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/16.jpg)
The Rank Generation Polynomial
otherwise
loop a is
,;/
,;/
otherwise
loop a is
,;
''
''''''
''
1''''''
1
e
yxeGS
yxeGyS
e
yx
yx
yxGS
GEF
FnFrGr
GEF
FnFrGr
![Page 17: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/17.jpg)
The Rank Generation Polynomial
otherwise
loop a is
,;/
,;/ e
yxeGS
yxeGyS
yxGSyxGSyxGS ,;,;,; 10
otherwise
bridge a is
,;
,; e
yxeGS
yxeGxS
+
![Page 18: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/18.jpg)
The Rank Generation Polynomial
yxGSyxGSyxGS ,;,;,; 10
otherwise
loop a is
bridge a is
,;/,;
,;/,;
,;/,;
e
e
yxeGSyxeGS
yxeGySyxeGS
yxeGSyxeGxS
![Page 19: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/19.jpg)
The Rank Generation Polynomial
yxGSyxGSyxGS ,;,;,; 10
otherwise
loop a is
bridge a is
,;/,;
,;,;
,;/,;
e
e
yxeGSyxeGS
yxeGySyxeGS
yxeGSyxeGxS
Obvious
![Page 20: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/20.jpg)
The Rank Generation Polynomial
yxGSyxGSyxGS ,;,;,; 10
otherwise
loop a is
bridge a is
,;/,;
,;1
,;/,;
e
e
yxeGSyxeGS
yxeGSy
yxeGSyxeGxS
Obvious
![Page 21: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/21.jpg)
The Rank Generation Polynomial
yxGSyxGSyxGS ,;,;,; 10
otherwise
loop a is
bridge a is
,;/,;
,;1
,;,;
e
e
yxeGSyxeGS
yxeGSy
yxeGSyxeGxS
FreErFreEr
FnFneEF
''''''
,'''
kkVVGG 11'''
![Page 22: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/22.jpg)
The Rank Generation Polynomial
yxGSyxGSyxGS ,;,;,; 10
otherwise
loop a is
bridge a is
,;/,;
,;1
,;1
e
e
yxeGSyxeGS
yxeGSy
yxeGSx
Obvious
Q.E.D
![Page 23: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/23.jpg)
The Tutte Polynomial
![Page 24: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/24.jpg)
The Tutte Polynomial
Reminder
4
5
![Page 25: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/25.jpg)
The Universal Tutte Polynomial
yx
GT
yxGU
GrGnGk ,;
,,,,;
![Page 26: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/26.jpg)
The Universal Tutte Polynomial
otherwise
loop a is
bridge a is
,;/,;
,;
,;
,,,,;
e
e
yxeGUyxeGU
yxeGUy
yxeGUx
yxGU
Theorem 6
nn yxEU ,,,,;
![Page 27: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/27.jpg)
The Universal Tutte Polynomial
Theorem 6 - Proof
nn
nVVVVV
n
yxET
yxEU
111
,;
,,,,;
0
5
![Page 28: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/28.jpg)
The Universal Tutte Polynomial
1
1
bridge a is
GreGr
GneGn
GkeGk
e
If e is a bridge
yx
eGTx
yxGU
eGreGneGk ,;
,,,,;
11
4
![Page 29: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/29.jpg)
The Universal Tutte Polynomial
If e is a bridge
,,,,;
,;
,;
,,,,;
11
yxeGxU
yxeGxT
yxeGT
x
yxGU
eGreGneGk
eGreGneGk
![Page 30: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/30.jpg)
The Universal Tutte Polynomial
GreGr
GneGn
GkeGk
e 1loop a is
If e is a loop
yx
eGTy
yxGU
eGreGneGk ,;
,,,,;
1
4
![Page 31: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/31.jpg)
The Universal Tutte Polynomial
If e is a bridge
,,,,;
,;
,;
,,,,;
1
yxeGyU
yxeGyT
yxeGT
y
yxGU
eGreGneGk
eGreGneGk
![Page 32: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/32.jpg)
The Universal Tutte Polynomial
1/
/
1
/
loop a is
bridge a is
GreGr
GreGr
GneGn
GneGn
GkeGkeGk
e
e
If e is neither a loop nor a bridge
![Page 33: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/33.jpg)
The Universal Tutte Polynomial
If e is neither a loop nor a bridge
4
yxeGT
yxeGT
yxGUGrGnGk
,;/,;
,,,,;
![Page 34: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/34.jpg)
The Universal Tutte Polynomial
If e is neither a loop nor a bridge
yxeGT
yxeGT
yxGU
eGreGneGk
eGreGneGk
,;/
,;
,,,,;
1///
1
![Page 35: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/35.jpg)
The Universal Tutte Polynomial
If e is neither a loop nor a bridge
,,,,;/
,,,,;
,,,,;
yxeGU
yxeGU
yxGU
![Page 36: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/36.jpg)
The Universal Tutte Polynomial
otherwise
loop a is
bridge a is
,;/,;
,;
,;
,,,,;
e
e
yxeGUyxeGU
yxeGUy
yxeGUx
yxGU
Theorem 6 - Proof
Q.E.D
![Page 37: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/37.jpg)
The Universal Tutte Polynomial
otherwise
loop a is
bridge a is
,;/,;
,;
,;
,,,,;..,,,,;
e
e
yxeGVyxeGV
yxeGVy
yxeGVx
yxGVtsyxGV
Theorem 7
nn yxEV ,,,,;
,,,,;,,,,; yxGUyxGV then
![Page 38: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/38.jpg)
The Universal Tutte Polynomial
otherwise
loop a is
bridge a is
,;/,;
,;
,;
,,,,;
e
e
yxeGVyxeGV
yxeGVy
yxeGVx
yxGV
Theorem 7 – proof
V(G) is dependant entirely on V(G-e) and V(G/e).In addition – ,,,,;,,,,; yxEUyxEV nn
Q.E.D
![Page 39: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/39.jpg)
Evaluations of the Tutte Polynomial
Proposition 8
1,1,GT
Let G be a connected graph.
is the number of spanning trees of G
Shown in the previous lecture
![Page 40: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/40.jpg)
Evaluations of the Tutte Polynomial
Proposition 8
2,1,GT
Let G be a connected graph.
is the number of connected
spanning sub-graphs of G
GEF
FnEkFkGSGT 101,0;2,1;
EkFkGEFEkFkGEF
Fn 11
![Page 41: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/41.jpg)
Evaluations of the Tutte Polynomial
Proposition 8
2,1,GT
Let G be a connected graph.
is the number of connected
spanning sub-graphs of G
EkFkGEF
GT 12,1;
sub-graphs of G connected
![Page 42: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/42.jpg)
Evaluations of the Tutte Polynomial
Proposition 8
1,2,GT
Let G be a connected graph.
is the number of (edge sets forming)
spanning forests of G
GEF
FnEkFkGSGT 010,1;1,2;
0
1FnGEF Spanning forests
![Page 43: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/43.jpg)
Evaluations of the Tutte Polynomial
Proposition 8
2,2,GT
Let G be a connected graph.
is the number of spanning
sub-graphs of G
GEF
FnEkFkGSGT 111,1;2,2;
GEF
1
![Page 44: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/44.jpg)
The Universal Tutte Polynomial
Theorem 9
0,1;1; xGTxxG GkGr
The chromatic polynomial and the Tutte polynomial are related by the equation :
![Page 45: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/45.jpg)
The Universal Tutte Polynomial
Theorem 9 – proof
1,1,,0,
1,; xx
xGUxG
Claim :
![Page 46: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/46.jpg)
The Universal Tutte Polynomial
Theorem 9 – proof
We must show that :
1,1,,0,
1,; xx
xEUxE nn
![Page 47: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/47.jpg)
The Universal Tutte Polynomial
Theorem 9 – proofand :
otherwise
loop a is
bridge a is
1;/
1;
0
1;
1
1;
e
e
x
xeG
x
xeG
x
xeG
x
x
x
xG
![Page 48: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/48.jpg)
The Universal Tutte Polynomial
Theorem 9 – proof
1,1,,0,
1,; xx
xEUxE nn
nn xxE ; Obvious. (empty graphs)
nnn xxx
xEU
1,1,,0,1
,
![Page 49: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/49.jpg)
The Universal Tutte Polynomial
Theorem 9 – proof
0;loop xGe Obvious
xeGxeGxGe ;/;;loopbridge
Chromatic polynomial property
xeGx
xxGe ;
1;bridge
Chromatic polynomial property
![Page 50: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/50.jpg)
The Universal Tutte Polynomial
Theorem 9 – proofThus :
otherwise
loop a is
bridge a is
1;/
1;
0
1;
1
1;
e
e
x
xeG
x
xeG
x
xeG
x
x
x
xG
![Page 51: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/51.jpg)
The Universal Tutte Polynomial
Theorem 9 – proof
And so, due to the uniqueness we shownin Theorem 7 :
1,1,,0,
1,; xx
xGUxG
![Page 52: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/52.jpg)
The Universal Tutte Polynomial
Theorem 9 – proof
Remembering that :
yx
GT
yxGU
GrGnGk ,;
,,,,;
![Page 53: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/53.jpg)
The Universal Tutte Polynomial
Theorem 9 – proof
Remembering that :
Q.E.D
0,1,1
0,1,11
1,1,,0,1
,;
xGTx
xGTx
xx
xGUxG
GrGk
GrGnGk
![Page 54: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/54.jpg)
Evaluations of the Tutte Polynomial
0,2,GT
Let G be a connected graph.
is the number of acyclic orientations
of G.
We know that (Theorem 9) –
0,1;1; xGTxxG GkGr
![Page 55: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/55.jpg)
Evaluations of the Tutte Polynomial
0,11,0,2, GTGTSo –
And thus –
1;11;1
1
1;
1
;0,2,
GG
G
x
xGGT
VV
VGkGrGkGr
![Page 56: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/56.jpg)
Acyclic Orientations of Graphs
Let G be a connected graph without loops or multiple edges.
An orientation of a graph is received afterassigning a direction to each edge.
An orientation of a graph is acyclic if it doesnot contain any directed cycles.
![Page 57: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/57.jpg)
Acyclic Orientations of Graphs
xG, is the number of pairs where
is a map
Proposition 1.1
,
xV ,...,3,2,1: and isan orientation of G, subject to the following :
• The orientation is acyclic• vuvu
![Page 58: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/58.jpg)
Acyclic Orientations of Graphs
Proof
The second condition forces the map to be aproper coloring.
The second condition is immediately impliedfrom the first one.
![Page 59: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/59.jpg)
Acyclic Orientations of Graphs
Proof
Conversely, if the map is proper, than thesecond condition defines a unique acyclicorientation of G.
Hence, the number of allowed mappings issimply the number of proper coloring with xcolors, which is by definition xG,
![Page 60: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/60.jpg)
Acyclic Orientations of Graphs
xG,~ be the number of pairs where
is a map
,
xV ,...,3,2,1: and isan orientation of G, subject to the following :
• The orientation is acyclic• vuvu
![Page 61: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/61.jpg)
Acyclic Orientations of Graphs
xGxGNx V ,1,~
Theorem 1.2
0,2,GT
![Page 62: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/62.jpg)
Acyclic Orientations of Graphs
Proof
The chromatic polynomial is uniquelydetermined by the following :
xxG ,0 G0 is the one vertex graph
xHxGxHG ,,, Disjoint union
xeGxeGxG ,/,,
![Page 63: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/63.jpg)
Acyclic Orientations of Graphs
Proof
We now have to show for the new polynomial :
xxG ,~0 G0 is the one vertex graph
xHxGxHG ,~,~,~ Disjoint union
xeGxeGxG ,/~,~,~
Obvious
Obvious
![Page 64: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/64.jpg)
Acyclic Orientations of Graphs
Proof
We need to show that :
xeGxeGxG ,/~,~,~
xeGV ,...,3,2,1: Let :
![Page 65: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/65.jpg)
Acyclic Orientations of Graphs
Proof
xeGV ,...,3,2,1: Let :
vue ,
Let be an acyclic orientation of G-ecompatible with
Let :
![Page 66: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/66.jpg)
Acyclic Orientations of Graphs
Proof
Let be an orientation of G after adding{u v} to
1
Let be an orientation of G after adding{v u} to
2
![Page 67: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/67.jpg)
Acyclic Orientations of Graphs
Proof
We will show that for each pair exactly one of the orientations is acyclic and compatible with ,expect forof them, in which case both are acyclic orientations compatible with
, 21,
21,
xeG ,/~
![Page 68: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/68.jpg)
Acyclic Orientations of Graphs
Proof
Once this is done, we will know that –
due to the definition of
xeGxeGxG ,/~,~,~ xG,~
![Page 69: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/69.jpg)
Acyclic Orientations of Graphs
Proof
For each pair where -
and is an acyclic orientation compatiblewith one of these three scenarios musthold :
,
xeGV ,...,3,2,1:
![Page 70: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/70.jpg)
Acyclic Orientations of Graphs
Proof
vu Case 1 –
Clearly is not compatible with whileis compatible. Moreover, is acyclic :
2 1
1uwwvu 21
uwwvu 21
Impossible cicle
![Page 71: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/71.jpg)
Acyclic Orientations of Graphs
Proof
vu Case 2 –
Clearly is not compatible with whileis compatible. Moreover, is acyclic :
1 2
2vwwuv 21
vwwuv 21
Impossible cicle
![Page 72: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/72.jpg)
Acyclic Orientations of Graphs
Proof
vu Case 3 –
Both are compatible with At least one is also acyclic. Suppose not, then:
vwwuv '2'1
uwwvu 21
21 contains
contains
![Page 73: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/73.jpg)
Acyclic Orientations of Graphs
Proof
vwwuv '2'1
uwwvu 21
21 contains
contains
uwvwu 1'1
contains
Impossible cicle
![Page 74: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/74.jpg)
Acyclic Orientations of Graphs
ProofWe now have to show that both andare acyclic for exactly pairs of with vu
21 xeG ,/~ ,
Let z denote the vertex identifying {u,v} ineG /
![Page 75: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/75.jpg)
Acyclic Orientations of Graphs
ProofZeG /
some acyclic orientation compatible with
uv
impossible to add a circle by the new edge {u,v}
G
two acyclic orientations, compatible with
![Page 76: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/76.jpg)
Acyclic Orientations of Graphs
ProofZeG /
exactly one, necessarily acyclic, compatible with
uv
Some two acyclic orientations, compatible with
G
All other vertices of G remains the same
![Page 77: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/77.jpg)
Acyclic Orientations of Graphs
ProofAnd so both and are acyclic for exactly pairs of with
And so –
vu
21 xeG ,/~ ,
xeGxeGxG ,/~,~,~
![Page 78: The Tutte Polynomial Graph Polynomials 238900 winter 05/06](https://reader035.vdocument.in/reader035/viewer/2022062322/56649efb5503460f94c0d702/html5/thumbnails/78.jpg)
Acyclic Orientations of Graphs
ProofIt is obvious that for x = 1 every orientationis compatible with
And so the expression count the number ofacyclic orientations in G
Q.E.D
1: V