A GCH example of an ordinal graph with no infinite path
Author: Jean A. Larson
Journal: Trans. Amer. Math. Soc. 303 (1987), 383-393
MSC: Primary 03E50; Secondary 03E05, 04A20, 05C99
MathSciNet review: 896028
Full-text PDF Free Access
Abstract: It is hard to find nontrivial positive partition relations which hold for many ordinals in ordinary set theory, or even ordinary set theory with the additional assumption of the Generalized Continuum Hypothesis. Erdös, Hajnal and Milner have proved that limit ordinals satisfy a positive partition relation that can be expressed in graph theoretic terms. In symbols one writes to mean that every graph on an ordinal either has a subset order isomorphic to in which no two points are joined by an edge or has an infinite path. This positive result generalizes to ordinals of cardinality for a natural number. However, the argument, based on a set mapping theorem, works only on the initial segment of the limit ordinals of cardinality for which the set mapping theorem is true. In this paper, the Generalized Continuum Hypothesis is used to construct counterexamples for a cofinal set of ordinals of cardinality , where is a natural number at least two.
-  J. Baumgartner and J. Larson, A diamond example of an ordinal graph with no infinite paths.
-  Tim Carlson, The pin-up conjecture, Axiomatic set theory (Boulder, Colo., 1983) Contemp. Math., vol. 31, Amer. Math. Soc., Providence, RI, 1984, pp. 41–62. MR 763892, https://doi.org/10.1090/conm/031/763892
-  P. Erdős, A. Hajnal, and E. C. Milner, Set mappings and polarized partition relations, Combinatorial theory and its applications, I (Proc. Colloq., Balatonfüred, 1969) North-Holland, Amsterdam, 1970, pp. 327–363. MR 0299537
-  John Gregory, Higher Souslin trees and the generalized continuum hypothesis, J. Symbolic Logic 41 (1976), no. 3, 663–671. MR 0485361, https://doi.org/10.2307/2272043
-  Thomas Jech, Set theory, Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1978. Pure and Applied Mathematics. MR 506523
-  J. Larson, Martin's Axiom and ordinal graphs: large independent sets or infinite paths.
- J. Baumgartner and J. Larson, A diamond example of an ordinal graph with no infinite paths.
- T. Carlson, The pin-up conjecture, Axiomatic Set Theory, Contemp. Math., vol. 31, Amer. Math. Soc., Providence, R.I., 1984, pp. 41-62. MR 763892 (86b:03059)
- P. Erdös, A. Hajnal and E. C. Milner, Set mappings and polarized partition relations, Combinatorial Theory and its Applications, Balatonfüred, Colloq. Math. Soc. János Bolyai, vol. 4, North-Holland, Amsterdam, 1969, pp. 327-363. MR 0299537 (45:8585)
- J. Gregory, Higher Souslin trees and the Generalized Continuum Hypothesis, J. Symbolic Logic 41 (1976), 663-671. MR 0485361 (58:5208)
- T. Jech, Set theory, Academic Press, New York, 1978. MR 506523 (80a:03062)
- J. Larson, Martin's Axiom and ordinal graphs: large independent sets or infinite paths.