Topology, forcing, and graph colourings
arXiv:2604.05554
Abstract
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 are ''weakly minimal'' for such colourings.