Small universal families for graphs omitting cliques without GCH

DOI10.1007/s00153-010-0197-4zbMath1200.03022MaRDI 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 graphs; universal models; infinite combinatorics; graphs omitting cliques

Mathematics Subject Classification ID

03E55: Large cardinals

03E50: Continuum hypothesis and Martin's axiom

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

03E05: Other combinatorial set theory

03C55: Set-theoretic model theory