On c^+-chromatic graphs with small bounded subgraphs

DOI10.1007/BF01946375MaRDI QIDQ916653zbMATH OpenFDO

Authors Lajos Soukup

Publication date 1990

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

consistencychromatic numberforcing posetkappa-good graph

Mathematics Subject Classification ID

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

Recommendations

• Generic graph construction
• Consistency results on infinite graphs
• Forcing constructions for uncountably chromatic graphs
• scientific article; zbMATH DE number 4200229
• Chromatic numbers of graphs -- large gaps

Cites work

• scientific article; zbMATH DE number 3652325 (Why is no real title available?)
• Generic graph construction

Cited in

(4)

• Generic graph construction
• Same graph, different universe
• Chromatic numbers of graphs -- large gaps
• On graphs with small subgraphs of large chromatic number

This page was built for publication: On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs

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