scientific article; zbMATH DE number 4200229

MaRDI QIDQ3348927zbMATHFDO

Authors S. Shelah

Publication date 1990

zbMATH Keywords

chromatic numbercolouring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Ordinal and cardinal numbers (03E10)

Recommendations

• Consistency results on infinite graphs
• The Colouring Number
• On incompactness for chromatic number of graphs
• Generic graph construction
• Chromatic numbers of graphs -- large gaps

Cited in

(15)

• Generic graph construction
• On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs
• Consistency results on infinite graphs
• On the number of non-isomorphic subgraphs
• A note on the Engelking-Karłowicz theorem
• Wild edge colourings of graphs
• Forcing constructions for uncountably chromatic graphs
• Chromatic numbers of graphs -- large gaps
• A microscopic approach to Souslin-tree constructions. I.
• scientific article; zbMATH DE number 15458 (Why is no real title available?)
• The uncountable Hadwiger conjecture and characterizations of trees using graphs
• Hedetniemi's conjecture for uncountable graphs
• scientific article; zbMATH DE number 1795298 (Why is no real title available?)
• On incompactness for chromatic number of graphs
• Incompactness in regular cardinals

This page was built for publication:

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