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.