Guichard-Combinatorics-Graph-Theory · Problem 5.9.4

Graph Theory

Mathematics — Probability · chromatic-polynomial

Problem

Show that the coefficient of kn−1k^{n-1} in PGP_G is −1-1 times the number of edges in GG.

Browse the problem library