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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Noam Greenberg
Dominique Lecomte
Dan Turetsky
Building similarity graph...
Analyzing shared references across papers
Loading...
Greenberg et al. (Tue,) studied this question.
www.synapsesocial.com/papers/69db35be4fe01fead37c445c — DOI: https://doi.org/10.48550/arxiv.2604.05554