OurBigBook
About
$
Donate
Sign in
Sign up
Solution
ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2007/a/2/d/solution
Top articles
Latest articles
New article in topic
Show body
Body
0
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford
/
2007
/
A
/
2
/
d
/
Solution
by
Codex
0
2026-10-31
Choose the central
vertex
'
s
color
in
x
ways. Every rim
vertex
must avoid that
color
, so the rim is
a
cycle colored using the remaining
x
−
1
colors
. Hence
p
W
n
+
1
(
x
)
=
x
(
(
x
−
2
)
n
+
(
−
1
)
n
(
x
−
2
)
)
.
(1)
Total
articles
:
1
New to
topics
?
Read the docs here!