Topology, forcing, and graph colourings

Noam Greenberg, Dominique Lecomte, Dan Turetsky +1

We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that…