Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-26T04:26:32.369Z Has data issue: false hasContentIssue false
  • English
  • Français

Colorful Partitions of Cardinal Numbers

Published online by Cambridge University Press:  20 November 2018

J. Baumgartner ,
P. Erdös ,
F. Galvin  and
J. Larson
J. Baumgartner
Affiliation:
Dartmouth College, Hanover, New Hampshire
P. Erdös
Affiliation:
University of Colorado, Boulder, Colorado
F. Galvin
Affiliation:
University of Kansas, Lawrence, Kansas
J. Larson
Affiliation:
University of Florida, Gainesville, Florida
Rights & Permissions [Opens in a new window]

Extract

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.

Use the two element subsets of κ, denoted by [κ]2, as the edge set for the complete graph on κ points. Write CP(κ, µ, v) if there is an edge coloring R: [κ]2 → µ with µ colors so that for every proper v element set X ⊊ κ, there is a point x ∈ κ ∼ X so that the edges between x and X receive at least the minimum of µ and v colors. Write CP⧣(K, µ, v) if the coloring is oneto- one on the edges between x and elements of X.

Peter W. Harley III [5] introduced CP and proved that for κ ≧ ω, CP(κ+, κ, κ) holds to solve a topological problem, since the fact that CP(ℵ1, ℵ0, ℵ0) holds implies the existence of a symmetrizable space on ℵ1 points in which no point is a Gδ.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 31 , Issue 3 , 01 June 1979 , pp. 524 - 541
Copyright
Copyright © Canadian Mathematical Society 1979

References

1. Baumgartner, J., Almost-dis joint sets, the dense set problem and the partition calculus, Annals Math. Logi. 10 (1976), 401–439.Google Scholar
2. Ben-David, S., On Shelah's compactness of cardinals, preprint.Google Scholar
3. Erdos, P., Gillman, L. and Henricksen, M., An isomorphism theorem for real closed fields, Annals of Math. 61 (1955), 542–554.Google Scholar
4. Erdôs, P., Hajnal, A. and Milner, E. C., On the complete subgraphs of graphs defined by systems of sets, Acta Math. Acad. Sci. Hungarica 17, (1966), 159–229.Google Scholar
5. Harley III, P. W. and Stephenson, R. M., Jr., Symmetrizable and related spaces, Trans. Amer. Math. Soc. 219 (1976), 89–111.Google Scholar
6. Milner, E. C., Transversals of disjoint sets, J. London Math. Soc. 43 (1968), 495–500.Google Scholar
7. Prikry, K., private communication.Google Scholar
8. Trotter, W., Jr., private communication.Google Scholar