The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear

Alexander A. Razborov. The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear. Discrete Mathematics, 108(1-3):393-396, 1992. [doi]

Abstract

Abstract is missing.