2 papers
math.GN2026
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…
math.GN2025
Continuous colorings on compact spaces
Noé de Rancourt, Dominique Lecomte, Miroslav Zelen
We study several natural classes of graphs on a zero-dimensional metrizable compact space having no continuous coloring. We compare these graphs with the quasi-order associated wit…