Question: 12. Given 2 5k 12. Given 2 S k n, denote by Ck(n) the maximal integer that is such that in every k-colouring of the

12. Given 2 5k
12. Given 2 S k n, denote by Ck(n) the maximal integer that is such that in every k-colouring of the edges of Kn we can find a connected monochromatic subgraph of order Ck(n). Show that C2(n) = n. (See Exercise 1.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
