Borel chromatic number of closed graphs
Dominique Lecomte (IMJ), Miroslav Zeleny

TL;DR
This paper constructs specific closed graphs with a Borel chromatic number of two and varying Baire class chromatic numbers, demonstrating the diversity of chromatic properties within closed graphs.
Contribution
It introduces a method to construct closed graphs with prescribed Baire class chromatic numbers, expanding understanding of graph coloring complexities.
Findings
Existence of closed graphs with Borel chromatic number two
Construction of graphs with Baire class $\xi$ chromatic number $\xi ext{-}\aleph_0$
Demonstration of the diversity in chromatic properties of closed graphs
Abstract
We construct, for each countable ordinal , a closed graph with Borel chromatic number two and Baire class chromatic number .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Limits and Structures in Graph Theory
