Chromatic numbers of graphs -- large gaps (Q313434)

We say that a graph \(G\) is \((\aleph_0,\kappa)\)-chromatic if \(\mathrm{Chr}(G)=\kappa\), while \(\mathrm{Chr}(G') \leq \aleph_0\) for any subgraph \(G'\) of \(G\) of size \(<| G| \). The main result of this paper reads as follows. If \(\square_{\lambda}+\mathrm{CH}_{\lambda}\) holds for a given uncountable cardinal \(\lambda\), then for every cardinal \(\kappa \leq \lambda\), there exists an \((\aleph_{0},\kappa)\)-chromatic graph of size \(\lambda ^{+}\). We also study \((\aleph_{0}, \lambda ^{+})\)-chromatic graphs of size \(\lambda ^{+}\). In particular, it is proved that if \(0^{\sharp}\) does not exist, then for every singular strong limit cardinal \(\lambda\), there exists an \((\aleph_{0}, \lambda ^{+})\)-chromatic graph of size \(\lambda ^{+}\).