We present a system of linear equations associated to a graph, with the property that if the system is consistent, then the chromatic number of the graph is at least four. We show how the system is inspired by the subject of topological bounds on the chromatic number of a graph, and further connections with the latter subject.

This is joint work with Gord Simons and David Wehlau.