Small universal families of graphs on $\aleph_{\omega+1}$
James Cummings, Mirna D\v{z}amonja, Charles Morgan

TL;DR
This paper demonstrates the consistency of having a strong limit cardinal _, a large power set, and a small universal family of graphs on _{+1} using advanced forcing techniques.
Contribution
It introduces a method to simultaneously control the size of the continuum and the universality number of graphs on _{+1} via Prikry forcing with interleaved collapsing.
Findings
_ is a strong limit in the model.
The continuum ^{_} can be made arbitrarily large.
The universality number for graphs on _{+1} is small in the constructed model.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
