scientific article; zbMATH DE number 4200229

MaRDI QIDQ3348927zbMATH OpenFDO

Authors S. Shelah

Publication date 1990

zbMATH Keywords

chromatic numbercolouring number

Mathematics Subject Classification ID

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

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

(17)

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

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)