Hostname: page-component-848d4c4894-hfldf Total loading time: 0 Render date: 2024-05-16T00:29:43.173Z Has data issue: false hasContentIssue false

Coloring Ordered Sets to Avoid Monochromatic Maximal Chains

Published online by Cambridge University Press:  20 November 2018

D. Duffus
Affiliation:
Mathematics and Computer Science, Emory University, Atlanta, Georgia, USA 30322
V. Rodl
Affiliation:
Mathematics and Computer Science, Emory University, Atlanta, Georgia, USA 30322
N. Sauer
Affiliation:
Mathematics and Statistics, University of Calgary, Calgary, Alberta T2N 1N4
R. Woodrow
Affiliation:
Mathematics and Statistics, University of Calgary, Calgary, Alberta T2N 1N4
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper is devoted to settling the following problem on (infinite, partially) ordered sets: Is there always a partition (2-coloring) of an ordered set X so that all nontrivial maximal chains of X meet both classes (receive both colors)? We show this is true for all countable ordered sets and provide counterexamples of cardinality N3. Variants of the problem are also considered and open problems specified.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1991

References

[EH] Erdős, P., Hajnal, A., Mate, A., Rado, R., Combinatorial set theory: partition relations for cardinals. North Holland, Amsterdam, 1984.Google Scholar
[Ju] Juhasz, I., Consistency results in topology, Handbook of Mathematical Logic, ed. J. Barwise, North Holland, Amsterdam, 1977. 503522.Google Scholar
[Ro] Rosenstein, J., Linear orderings. Academic Press, New York, 1982.Google Scholar
[Ru] Rudin, M., Martin's axiom, Handbook of Mathematical Logic, ed. J. Barwise, North Holland, Amsterdam, 1977.491501.Google Scholar