On \({\mathfrak c}^+\)-chromatic graphs with small bounded subgraphs

DOI10.1007/BF01946375zbMath0704.03029MaRDI QIDQ916653

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

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

Related Items (1)

Chromatic numbers of graphs -- large gaps

Cites Work

• Generic graph construction
• Unnamed Item

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