Small universal families for graphs omitting cliques without GCH
From MaRDI portal
Publication:711564
Recommendations
Cites work
- An inner model for global domination
- Model theory.
- On universal graphs without instances of CH
- Perfect trees and elementary embeddings
- Perfect-set forcing for uncountable cardinals
- Universal graphs at the successor of a singular cardinal
- Universal graphs without large cliques
- Universal structures in power ℵ1
- Universality for orders and graphs which omit large substructures
Cited in
(8)- Small universal families of graphs on \(\aleph_{\omega +1}\)
- Universal graphs omitting finitely many finite graphs
- Universality among graphs omitting a complete bipartite graph
- Universal graphs without large bipartite graphs assuming GCH
- Universal graphs without large cliques
- Universal infinite clique-omitting graphs
- Universality for orders and graphs which omit large substructures
- Some positive results in the context of universal models
This page was built for publication: Small universal families for graphs omitting cliques without GCH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711564)