## Bipartite graph proof

Prove that X(G) = w(G), when G is bipartite.

Let X(G) denote the chromatic number of G.
Let w(G) denote the max size of a clique in G.