Generic graph construction

DOI10.2307/2274106MaRDI QIDQ3690808zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Forcing constructions for uncountably chromatic graphs
• On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs
• scientific article; zbMATH DE number 4200229
• Consistency results on infinite graphs
• scientific article; zbMATH DE number 426350

Cites work

• Combinatorial set theory

Cited in

(18)

• scientific article; zbMATH DE number 426350 (Why is no real title available?)
• scientific article; zbMATH DE number 3987277 (Why is no real title available?)
• A graph which embeds all small graphs on any large set of vertices
• A Ramsey-style extension of a theorem of Erdős and Hajnal
• Same graph, different universe
• Chromatic numbers of graphs -- large gaps
• Forcing constructions for uncountably chromatic graphs
• In memoriam: James Earl Baumgartner (1943--2011)
• On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs
• Consistency results on infinite graphs
• Some downwards transfer properties for \(\aleph _ 2\)
• A consistent edge partition theorem for infinite graphs
• The Erdős-Hajnal problem list
• Potent Axioms
• Ramsey-Theory and Forcing Extensions
• Erdős and set theory
• Hedetniemi's conjecture for uncountable graphs
• Some remarks on the simultaneous chromatic number

This page was built for publication: Generic graph construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690808)