Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Borel chromatic numbers of closed graphs and forcing with uniform trees (2208.06914v1)

Published 14 Aug 2022 in math.LO and math.CO

Abstract: In this work, we continue the tradition initiated by Geschke, 2011 of viewing the uncountable Borel chromatic number of analytic graphs as cardinal invariants of the continuum. We show that various uncountable Borel chromatic numbers of closed graphs can be consistently different, as well as consistently equal to the continuum. This is done using arguments that are typical to Axiom A forcing notions.

Summary

We haven't generated a summary for this paper yet.