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]
@article{Razborov92:1,
title = {The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear},
author = {Alexander A. Razborov},
year = {1992},
doi = {10.1016/0012-365X(92)90691-8},
url = {http://dx.doi.org/10.1016/0012-365X(92)90691-8},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Razborov92%3A1},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {108},
number = {1-3},
pages = {393-396},
}