Small universal families of graphs on ω+1
Abstract
We prove that it is consistent that ω is strong limit, 2ω is large and the universality number for graphs on ω+1 is small. The proof uses Prikry forcing with interleaved collapsing.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.