Kneser's conjecture: the minimum number of colors in order to color the K(n,k) is n-2k+2. Where K(n,k) is the graph on "n choose k" vertices were two vertices are connected iff they are disjoint....
Find one counterexample to negate the statement
Give a counter-example.
by bringing evidence to the table
A counter example