New forcing notions are developed to establish that specific graphs have no countable Borel colorings of class alpha, together with weakly minimal examples of such graphs.
Descriptive complexity of countable unions of B orel rectangles
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GN 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Topology, forcing, and graph colourings
New forcing notions are developed to establish that specific graphs have no countable Borel colorings of class alpha, together with weakly minimal examples of such graphs.