On c^+-chromatic graphs with small bounded subgraphs

DOI10.1007/BF01946375zbMATH Open0704.03029MaRDI QIDQ916653FDOQ916653

Authors: Lajos Soukup 

Publication date: 1990

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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)