A correction to “Equivariant cohomology and lower bounds for chromatic numbers”

We introduce a general topological method for obtaining a lower bound of the chromatic number of an n-graph. We present numerical lower bounds for intersection n-graphs