Universality among the graph omitting a complete bipartite graph
Saharon Shelah
Abstract
For cardinals lambda, kappa, theta we consider the class of graphs of cardinality lambda which has no subgraph which is (kappa, theta)-complete bipartite graph. The question is whether in such a class there is a universal one under (weak) embedding. We solve this problem completely under GCH. Under various assumptions mostly related to cardinal arithmetic we prove nonexistence of universals for this problem and some related ones.
Create a lesson
Related papers
Remarks on ultrafilters exponentiation
Lorenzo Luperi Baglini, Boris Šobot
A characterization of the finite model property for ω-categorical theories
Vera Koponen
Baire measurable functions and automorphisms of the truth-table degrees
Bjørn Kjos-Hanssen
Teams, Truthmakers, Translations
Maria Aloni, Alexandru Baltag, Johan van Benthem et al.
A counterexample to Vaught's Conjecture for Lω1,ω
Nathanael L. Ackerman, Cameron E. Freer, Robin W. Knight
Internal Languages for Thin Epsilon-Hyperdoctrines: Soundness, Completeness, and Rocq Formalization
Zoltán Gábor Molnár, Csaba Tóth