Graph Coloring and Ramsey Theory
Colouring vertices and edges, the chromatic number and its bounds, and the Ramsey results that make disorder impossible.0/13 masteredCompute P(K4,5), the number of proper colourings of K4 with 5 available colours. Review the explanation for this topic →Type your answer — press Enter to checkEnter your answer