On incompactness for chromatic number of graphs

DOI10.1007/s10474-012-0287-3zbMath1299.03052arXiv1205.0064OpenAlexW2963642157MaRDI QIDQ2448949

Saharon Shelah

Publication date: 5 May 2014

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

Full work available at URL: https://arxiv.org/abs/1205.0064

zbMATH Keywords

compactnesschromatic numbernon-reflecting stationary set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05)

Related Items (6)

Chromatic numbers of graphs -- large gaps ⋮ Two remarks on the coloring number ⋮ On incompactness for chromatic number of graphs ⋮ The chromatic number of infinite graphs - A survey ⋮ ERDŐS AND SET THEORY ⋮ STATIONARY REFLECTION

Cites Work

• Unnamed Item
• Unnamed Item
• On incompactness for chromatic number of graphs
• Ordered Black Boxes: Existence

This page was built for publication: On incompactness for chromatic number of graphs