May 9th, 2019, 11:11 AM |
#1 |

Senior Member Joined: Apr 2017 From: New York Posts: 165 Thanks: 6 | proof
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. |

May 9th, 2019, 11:42 AM |
#2 |

Senior Member Joined: Sep 2015 From: USA Posts: 2,644 Thanks: 1476 |
I don't have an answer for you but this paper might https://www.math.ru.nl/OpenGraphProb...d%20Cooper.pdf |

May 9th, 2019, 12:58 PM |
#3 | |

Senior Member Joined: Apr 2017 From: New York Posts: 165 Thanks: 6 | Quote:
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. | |