Small universal families for graphs omitting cliques without GCH

DOI10.1007/S00153-010-0197-4zbMATH Open1200.03022OpenAlexW1966637575MaRDI QIDQ711564FDOQ711564

Authors: D. Kharzeev 

Publication date: 27 October 2010

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-010-0197-4

Recommendations

• Universal graphs without large cliques
• Universal infinite clique-omitting graphs
• Universal graphs without large bipartite graphs assuming GCH
• Universal graphs without large bipartite subgraphs
• Universal graphs omitting finitely many finite graphs

zbMATH Keywords

triangle-free graphsuniversal modelsinfinite combinatoricsgraphs omitting cliques

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Other combinatorial set theory (03E05) Set-theoretic model theory (03C55) Large cardinals (03E55) Continuum hypothesis and Martin's axiom (03E50)

Cites Work

• Model theory.
• 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 ℵ₁
• An inner model for global domination
• On universal graphs without instances of CH
• Universality for orders and graphs which omit large substructures

Cited In (3)

• Universal graphs without large bipartite graphs assuming GCH
• 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)