On incompactness for chromatic number of graphs

Saharon Shelah*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We deal with incompactness. Assume the existence of non-reflecting stationary set of cofinality κ. We prove that one can define a graph G whose chromatic number is >κ, while the chromatic number of every subgraph G′{subset double equals}G, {pipe}G′{pipe}<{pipe}G{pipe} is ≦κ. The main case is κ=א0.

Original languageEnglish
Pages (from-to)363-371
Number of pages9
JournalActa Mathematica Hungarica
Volume139
Issue number4
DOIs
StatePublished - Jun 2013

Keywords

  • 03E05
  • 05C15
  • chromatic number
  • compactness
  • graph
  • non-reflecting stationary set
  • set theory

Fingerprint

Dive into the research topics of 'On incompactness for chromatic number of graphs'. Together they form a unique fingerprint.

Cite this