Guichard-Combinatorics-Graph-Theory · Problem 5.9.5

Graph Theory

Mathematics — Probability · chromatic-polynomial

Problem

Show that

G

is a tree if and only if

P_G(k) = k(k-1)^{n-1}