proof

Apr 2017
165
6
New York
How can I proof (Kn, t) = t(t 1)(t 2)···(t (n 1)).

number of way of coloring a complete graph (Kn) with n vertex, with palette of t colors.
 
Apr 2017
165
6
New York