Universal countably chromatic graph

Abstract

We show that the existence of a universal countably chromatic graph of size ${\aleph }_1$ 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 $\hat{I}{º}^{+}$, where $\hat{I}º$ is regular.