Small universal families for graphs omitting cliques without GCH

DOI10.1007/s00153-010-0197-4zbMath1200.03022OpenAlexW1966637575MaRDI QIDQ711564

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

zbMATH Keywords

triangle-free graphsuniversal modelsinfinite combinatoricsgraphs omitting cliques

Mathematics Subject Classification ID

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

Cites Work

• On universal graphs without instances of CH
• Universality for orders and graphs which omit large substructures
• Model theory.
• Universal graphs without large cliques
• Universal graphs at the successor of a singular cardinal
• Universal structures in power ℵ₁
• An inner model for global domination
• Perfect trees and elementary embeddings
• Perfect-set forcing for uncountable cardinals

This page was built for publication: Small universal families for graphs omitting cliques without GCH