Identities on cardinals less than ℵω

DOI10.2307/2275784MaRDI QIDQ5687315zbMATH OpenOpenAlexFDO

Authors Martin Philip Gilchrist, S. Shelah

Publication date 12 December 1996

Published in Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

coloringconsistencyforcinggraphsubgraphs

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35)

Abstract: Let kappa be an uncountable cardinal and the edges of a complete graph with kappa vertices be colored with aleph_0 colors. For kappa >2^{aleph_0} the ErdH{o}s-Rado theorem implies that there is an infinite monochromatic subgraph. However, if kappa <= 2^{aleph_0}, then it may be impossible to find a monochromatic triangle. This paper is concerned with the latter situation. We consider the types of colorings of finite subgraphs that must occur when kappa <= 2^{aleph_0}. In particular, we are concerned with the case aleph_1 <= kappa <= aleph_omega

Recommendations

• The consistency of ZFC + 2^ℵ₀ > ℵ_ω + ℐ(ℵ₂) = ℐ(ℵ_ω)
• Consistency results on infinite graphs
• The Colouring Number
• Publication:4732473
• Embedding Graphs into Colored Graphs

Cites work

• A theorem and some consistency results in partition calculus
• Appendix to models with second order properties II trees with no undefined branches
• Models with second order properties II. Trees with no undefined branches

Cited in

(7)

• Consistency results on infinite graphs
• A consistent edge partition theorem for infinite graphs
• The cardinals below \(|[\omega_{1}]^{<\omega _{1}}|\)
• Coloring finite subsets of uncountable sets
• The consistency of ZFC + 2^ℵ₀ > ℵ_ω + ℐ(ℵ₂) = ℐ(ℵ_ω)
• NOTES ON SOME ERDŐS–HAJNAL PROBLEMS
• Ramsey theory for countable binary homogeneous structures

This page was built for publication: Identities on cardinals less than ℵ_ω

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