Key points are not available for this paper at this time.
Abstract We prove that it is consistent that _ is strong limit, 2^ _ is large and the universality number for graphs on + ₁ is small. The proof uses Prikry forcing with interleaved collapsing.
Cummings et al. (Wed,) studied this question.