Forcing constructions for uncountably chromatic graphs

DOI10.2307/2274566zbMath0657.03029OpenAlexW2123487632MaRDI QIDQ3804690

Saharon Shelah, Péter Komjáth

Publication date: 1988

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

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

zbMATH Keywords

forcingchromatic numberinfinite graphs

Mathematics Subject Classification ID

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

Related Items (6)

Consistency results on infinite graphs ⋮ On the growth rate of chromatic numbers of finite subgraphs ⋮ Trees, ladders and graphs ⋮ The chromatic number of infinite graphs - A survey ⋮ Elementary submodels in infinite combinatorics ⋮ Extremal triangle-free and odd-cycle-free colourings of uncountable graphs

Cites Work

• Unnamed Item
• What must and what need not be contained in a graph of uncountable chromatic number?
• Chromatic number of finite and infinite graphs and hypergraphs
• Can you take Solovay's inaccessible away?
• The Ramsey property for graphs with forbidden complete subgraphs
• A Negative Partition Relation

This page was built for publication: Forcing constructions for uncountably chromatic graphs