Chromatic Number and the 2-Rank of a Graph

We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2r+1, and that this bound is tight.