scientific article; zbMATH DE number 4200229

zbMATH Open0727.05025MaRDI QIDQ3348927FDOQ3348927

Authors: S. Shelah 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

chromatic numbercolouring number

Mathematics Subject Classification ID

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

Cited In (15)

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

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)