Published October 2021
| Submitted + Published
Journal Article
Open
A complexity problem for Borel graphs
- Creators
- Todorčević, Stevo
-
Vidnyánszky, Zoltán
Chicago
An error occurred while generating the citation.
Abstract
We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on [N]^N with finite (or, equivalently, ≤3) Borel chromatic number form a Σ1/2-complete set. This answers a question of Kechris and Marks and strengthens several earlier results.
Additional Information
© The Author(s) 2021. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. Received 04 March 2019; Accepted 25 March 2021; Published 10 May 2021. We would like to thank Benjamin Miller for the inspiring discussions, questions and for pointing out a way to prove the analytic-hardness of non-dominating sets using only classical tools (see Lemma 4.6). We are also very grateful to Slawomir Solecki, Alexander Kechris, Márton Elekes and Jan Grebík for their help, valuable comments and suggestions. Open access funding provided by University of Vienna. The first author's research was partially supported by grants of NSERC (455916) and CNRS (IMJ-PRG UMR7586). The second author was partially supported by the National Research, Development and Innovation Office – NKFIH, Grants no. 113047, no. 129211 and FWF Grants P29999 and M2779.Attached Files
Published - Todorčević-Vidnyánszky2021_Article_AComplexityProblemForBorelGrap.pdf
Submitted - 1710.05079.pdf
Files
Todorčević-Vidnyánszky2021_Article_AComplexityProblemForBorelGrap.pdf
Files
(683.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:c36dbe002c58b635ad979f898818efc4
|
389.7 kB | Preview Download |
|
md5:7349264284599c6b957b6e77649a12a7
|
294.0 kB | Preview Download |
Additional details
- Eprint ID
- 109132
- Resolver ID
- CaltechAUTHORS:20210514-103015736
- University of Vienna
- Natural Sciences and Engineering Research Council of Canada (NSERC)
- 455916
- Centre National de la Recherche Scientifique (CNRS)
- IMJ-PRG UMR7586
- National Research, Development and Innovation Fund (NKFIA)
- 113047
- National Research, Development and Innovation Fund (NKFIA)
- 129211
- FWF Der Wissenschaftsfonds
- P29999
- FWF Der Wissenschaftsfonds
- M2779
- Created
-
2021-05-14Created from EPrint's datestamp field
- Updated
-
2021-09-13Created from EPrint's last_modified field