My Math Forum  

Go Back   My Math Forum > College Math Forum > Applied Math

Applied Math Applied Math Forum


Thanks Tree1Thanks
  • 1 Post By romsek
Reply
 
LinkBack Thread Tools Display Modes
May 9th, 2019, 10:11 AM   #1
Senior Member
 
Joined: Apr 2017
From: New York

Posts: 155
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.
Leonardox is offline  
 
May 9th, 2019, 10:42 AM   #2
Senior Member
 
romsek's Avatar
 
Joined: Sep 2015
From: USA

Posts: 2,531
Thanks: 1390

I don't have an answer for you but this paper might

https://www.math.ru.nl/OpenGraphProb...d%20Cooper.pdf
Thanks from Leonardox
romsek is online now  
May 9th, 2019, 11:58 AM   #3
Senior Member
 
Joined: Apr 2017
From: New York

Posts: 155
Thanks: 6

Quote:
Originally Posted by romsek View Post
I don't have an answer for you but this paper might

https://www.math.ru.nl/OpenGraphProb...d%20Cooper.pdf
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.
Leonardox is offline  
Reply

  My Math Forum > College Math Forum > Applied Math

Tags
proof



Thread Tools
Display Modes






Copyright © 2019 My Math Forum. All rights reserved.