Universal graphs without large cliques

DOI10.1006/JCTB.1995.1008zbMath0830.03021arXivmath/9308221OpenAlexW1999724921MaRDI QIDQ1892834

Saharon Shelah, Péter Komjáth

Publication date: 2 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9308221

zbMATH Keywords

forcingGCHuniversal graphcofinality

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50) Other combinatorial set theory (03E05)

Related Items (8)

Universal graphs at the successor of a singular cardinal ⋮ Remarks on Gitik's model and symmetric extensions on products of the Lévy collapse ⋮ Induced subgraphs of zero-divisor graphs ⋮ Universality among graphs omitting a complete bipartite graph ⋮ Small universal families for graphs omitting cliques without GCH ⋮ Internal consistency for embedding complexity ⋮ Universal graphs omitting finitely many finite graphs ⋮ Club guessing and the universal models

This page was built for publication: Universal graphs without large cliques