Universal graphs without large cliques (Q1892834): Difference between revisions

We show that under GCH there is a universal graph of cardinality \(\lambda\) with no clique of size \(\kappa\) iff \(\kappa\) is finite or \(\text{cf} (\kappa)> \text{cf} (\lambda)\). The cofinality of the family of graphs of cardinality \(\lambda\) with no cliques of cardinality \(\kappa\) is \(\lambda^+\) if \(\text{cf} (\kappa) =\omega\) and \(\lambda\) is either strong limit or of the form \(\lambda= \mu^+= 2^\mu\). If \(\kappa= \omega_1\) the above cofinality can be \(2^\kappa\) and arbitrarily large, and can be \(\kappa^+\) with \(2^\kappa\) arbitrarily large.