I have a question regarding the process for finding the chromatic number of a complete graph contraining 16 vertices. I know how to do it the 'brute force' way in which you manually draw and count each unique edge within the graph, but for a 16 vertice graph this is rather difficult.
Google has failed to yield any sort of formula for simplifying this, does any have any idea where I should go from here?
Thanks in advance!
PS - Forgive me if this is the wrong section for this, but I also have another question on probability :
Suppose you flip a coin 3 times. What is the probability that exactly 1 of your flips were heads?
I think I'm merely over thinking this seemingly simple problem, can anyone point me in the right direction here?