Lower bounds on coloring numbers from hardness hypotheses in PCF theory
From MaRDI portal
Publication:6259754
DOI10.1090/PROC/13163arXiv1503.02423WikidataQ114094235 ScholiaQ114094235MaRDI QIDQ6259754FDOQ6259754
Authors: S. Shelah 
Publication date: 9 March 2015
Abstract: We prove that the statement "for every infinite cardinal nu, every graph with list chromatic nu has coloring number at most beth_omega (nu)" proved by Kojman [6] using the RGCH theorem [11] implies the RGCG theorem via a short forcing argument. Similarly, a better upper bound than beth_omega (nu) in this statement implies stronger forms of the RGCH theorem hold, whose consistency and the consistency of their negations are wide open. Thus, the optimality of Kojman's upper bound is a purely cardinal arithmetic problem, and, as discussed below, is hard to decide.
Coloring of graphs and hypergraphs (05C15) Other combinatorial set theory (03E05) Ordered sets and their cofinalities; pcf theory (03E04)
This page was built for publication: Lower bounds on coloring numbers from hardness hypotheses in PCF theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6259754)
