L Leonardox Apr 2017 165 6 New York May 9, 2019 #1 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.

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.

romsek Math Team Sep 2015 2,872 1,607 USA May 9, 2019 #2 I don't have an answer for you but this paper might https://www.math.ru.nl/OpenGraphProblems/Gerjan/Behzad%20Chartrand%20Cooper.pdf Reactions: 1 person

I don't have an answer for you but this paper might https://www.math.ru.nl/OpenGraphProblems/Gerjan/Behzad%20Chartrand%20Cooper.pdf

L Leonardox Apr 2017 165 6 New York May 9, 2019 #3 romsek said: I don't have an answer for you but this paper might https://www.math.ru.nl/OpenGraphProblems/Gerjan/Behzad%20Chartrand%20Cooper.pdf Click to expand... Very useful article that teaches number of colors we can apply. My search is not Chi number it is how many ways can the graph be colored ( counting problem) Still searching. thanks that was still great to confirm what I did in the previous section.

romsek said: I don't have an answer for you but this paper might https://www.math.ru.nl/OpenGraphProblems/Gerjan/Behzad%20Chartrand%20Cooper.pdf Click to expand... Very useful article that teaches number of colors we can apply. My search is not Chi number it is how many ways can the graph be colored ( counting problem) Still searching. thanks that was still great to confirm what I did in the previous section.