Topology, forcing, and graph colourings
General Topology
2026-04-08 v1 Logic
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.
Cite
@article{arxiv.2604.05554,
title = {Topology, forcing, and graph colourings},
author = {Noam Greenberg and Dominique Lecomte and Dan Turetsky and Miroslav Zelen},
journal= {arXiv preprint arXiv:2604.05554},
year = {2026}
}