Borel chromatic number of closed graphs
Logic
2014-12-16 v2 General Topology
Abstract
We construct, for each countable ordinal , a closed graph with Borel chromatic number two and Baire class chromatic number .
Cite
@article{arxiv.1406.7544,
title = {Borel chromatic number of closed graphs},
author = {Dominique Lecomte and Miroslav Zeleny},
journal= {arXiv preprint arXiv:1406.7544},
year = {2014}
}
Comments
The proof of the main lemma has been changed, and the main result is now better than in the previous version