Sh:1006

• Shelah, S. (2013). On incompactness for chromatic number of graphs. Acta Math. Hungar., 139(4), 363–371. arXiv: 1205.0064 DOI: 10.1007/s10474-012-0287-3 MR: 3061483
• Abstract:
  We deal with incompactness. Assume the existence of non-reflecting stationary set of cofinality \kappa. We prove that one can define a graph G whose chromatic number is >\kappa, while the chromatic number of every subgraph G' \subseteq G,|G'| < |G| is \le \kappa. The main case is \kappa = \aleph_0.
• Version 2014-01-31_12 (11p) published version (9p)

@article{Sh:1006,
 author = {Shelah, Saharon},
 title = {{On incompactness for chromatic number of graphs}},
 journal = {Acta Math. Hungar.},
 fjournal = {Acta Mathematica Hungarica},
 volume = {139},
 number = {4},
 year = {2013},
 pages = {363--371},
 issn = {0236-5294},
 mrnumber = {3061483},
 mrclass = {03E05 (05C15)},
 doi = {10.1007/s10474-012-0287-3},
 note = {\href{https://arxiv.org/abs/1205.0064}{arXiv: 1205.0064}},
 arxiv_number = {1205.0064}
}