Small universal families of graphs on
arXiv:1408.4188
Abstract
We prove that it is consistent that is strong limit, is large and the universality number for graphs on is small. The proof uses Prikry forcing with interleaved collapsing.
arXiv:1408.4188
We prove that it is consistent that is strong limit, is large and the universality number for graphs on is small. The proof uses Prikry forcing with interleaved collapsing.