Generic graph construction

DOI10.2307/2274106zbMath0573.03021OpenAlexW1966742389MaRDI QIDQ3690808

James E. Baumgartner

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274106

zbMATH Keywords

chromatic numberrelative consistencyforcing modelsubgraph property

Mathematics Subject Classification ID

Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

Related Items (8)

Chromatic numbers of graphs -- large gaps ⋮ Potent Axioms ⋮ Some downwards transfer properties for \(\aleph _ 2\) ⋮ Consistency results on infinite graphs ⋮ In memoriam: James Earl Baumgartner (1943--2011) ⋮ On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs ⋮ Hedetniemi's conjecture for uncountable graphs ⋮ ERDŐS AND SET THEORY

Cites Work

• Combinatorial set theory

This page was built for publication: Generic graph construction