Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings

DOI10.1007/s11856-014-0035-1zbMath1302.05056arXiv1510.02429OpenAlexW2029721492MaRDI QIDQ466092

Menachem Kojman

Publication date: 24 October 2014

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

list-chromatic number, coloring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Continuum hypothesis and Martin's axiom (03E50) Other combinatorial set theory (03E05) Infinite graphs (05C63)

Related Items (4)

On the arithmetic of density ⋮ The list-chromatic number of infinite graphs ⋮ Splitting families of sets in ZFC ⋮ Lower bounds on coloring numbers from hardness hypotheses in pcf theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The list-chromatic number of infinite graphs
• The list-chromatic number of infinite graphs defined on Euclidean spaces
• The generalized continuum hypothesis revisited
• More on the revised GCH and the black box
• NO BOUND FOR THE FIRST FIXED POINT
• Splitting Strongly Almost Disjoint Families
• On chromatic number of graphs and set-systems

This page was built for publication: Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings