This work introduces new forcing notions to explore countable colourings in graphs, suggesting deeper insights in topology.
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.
No takes yet. Share an insight, caveat, or question.
Greenberg et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: