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

DOI10.1007/S11856-014-0035-1MaRDI QIDQ466092zbMATH OpenOpenAlexFDO

Authors 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) Infinite graphs (05C63) Other combinatorial set theory (03E05) Continuum hypothesis and Martin's axiom (03E50)

Abstract: The $kappa$-density of a cardinal $mugekappa$ is the least cardinality of a dense collection of $kappa$-subsets of $mu$ and is denoted by $mathcalD(mu,kappa)$. The Singular Density Hypothesis (SDH) for a singular cardinal $mu$ of cofinality $cfmu=kappa$ is the equation $mathcalD(mu,kappa)=m{u}^{+}$. The Generalized Density Hypothesis (GDH) for $mu$ and $lambda$ such that $lambdalemu$ is: $mathcalD(mu,lambda)=mu$ if $cfmuot=cflambda$ and $mathcalD(mu,lambda)=m{u}^{+}$ if $cfmu=cflambda$. Density is shown to satisfy Silver's theorem. The most important case is: Theorem 2.6. If $kappa=cfkappa<heta=cfmu<mu$ and the set of cardinals $lambda<mu$ of cofinality $kappa$ that satisfy the extsf{SDH} is stationary in $mu$ then the SDH holds at $mu$. A more general version is given in Theorem 2.8 A corollary of Theorem 2.6 is: Theorem 3.2 If the Singular Density Hypothesis holds for all sufficiently large singular cardinals of some fixed cofinality $kappa$, then for all cardinals $lambda$ with $cflambdagekappa$, for all sufficiently large $mu$, the GDH holds.

Cites work

• scientific article; zbMATH DE number 446487 (Why is no real title available?)
• scientific article; zbMATH DE number 734993 (Why is no real title available?)
• scientific article; zbMATH DE number 1496580 (Why is no real title available?)
• More on the revised GCH and the black box
• NO BOUND FOR THE FIRST FIXED POINT
• On chromatic number of graphs and set-systems
• Splitting Strongly Almost Disjoint Families
• The generalized continuum hypothesis revisited
• The list-chromatic number of infinite graphs
• The list-chromatic number of infinite graphs defined on Euclidean spaces

Cited in

(5)

• Essentially disjoint families, conflict free colorings and Shelah's revised GCH
• Lower bounds on coloring numbers from hardness hypotheses in pcf theory
• On the arithmetic of density
• Splitting families of sets in ZFC
• The list-chromatic number of infinite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466092)