Reflection on the Coloring and Chromatic Numbers
- 55 Downloads
We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) is compatible with each of the following compactness principles: Rado’s conjecture, Fodor-type reflection, Δ-reflection, Stationary-sets reflection, Martin’s Maximum, and a generalized Chang’s conjecture. This is accomplished by showing that, under GCH-type assumptions, instances of incompactness for the chromatic number can be derived from square-like principles that are compatible with large amounts of compactness.
In addition, we prove that, in contrast to the chromatic number, the coloring number does not admit arbitrarily large incompactness gaps.
Mathematics Subject Classification (2010)03E35 05C15 05C63
Unable to display preview. Download preview PDF.
- P. Erdős and A. Hajnal: On chromatic number of infinite graphs, in: Theory of Graphs (Proc. Colloq., Tihany, 1966), 83–98. Academic Press, New York, 1968.Google Scholar
- S. Fuchino, H. Sakai, L. Soukup and T. Usuba: More about the Fodor-type Reflection principle, preprint, 2012.Google Scholar
- S. Fuchino, H. Sakai, V. T. Perez and T. Usuba: Rado’s Conjecture and the Fodor-type Reflection Principle, 2017, in preparation.Google Scholar
- T. Miyamoto: On the consistency strength of the FRP for the second uncountable cardinal, RIMS Kôkyûroku 1686 (2010), 80–92.Google Scholar
- S. Shelah: Notes on partition calculus, in: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. III, 1257–1276. Colloq. Math. Soc. János Bolyai, Vol. 10. North-Holland, Amsterdam, 1975.Google Scholar
- S. Todorčević: A note on the proper forcing axiom, in: Axiomatic set theory (Boulder, Colo., 1983), volume 31 of Contemp. Math., 209–218. Amer. Math. Soc., Providence, RI, 1984.Google Scholar
- S. Todorčević: Conjectures of Rado and Chang and cardinal arithmetic, in: Finite and infinite combinatorics in sets and logic (Banff, AB, 1991), volume 411 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 385–398. Kluwer Acad. Publ., Dordrecht, 1993.Google Scholar
- S. Unger: Compactness for the chromatic number at Nω1+1, unpublished note, 2015.Google Scholar