Universal countably chromatic graph
Logic
2025-11-12 v1
Abstract
We show that the existence of a universal countably chromatic graph of size together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works for any uncountable successor cardinal , where is regular.
Cite
@article{arxiv.2511.07608,
title = {Universal countably chromatic graph},
author = {Siiri Kivimäki},
journal= {arXiv preprint arXiv:2511.07608},
year = {2025}
}