Citation
P. Komjath et S. Shelah, COLORING FINITE SUBSETS OF UNCOUNTABLE SETS, Proceedings of the American Mathematical Society, 124(11), 1996, pp. 3501-3505
Citations number
7
Categorie Soggetti
Mathematics, General",Mathematics,Mathematics
Journal title
ISSN journal
00029939
Volume
124
Issue
11
Year of publication
1996
Pages
3501 - 3505
Database
ISI
SICI code
0002-9939(1996)124:11<3501:CFSOUS>2.0.ZU;2-L
Abstract
It is consistent for every 1 less than or equal to n < w that 2w = w(n
) and there is a function F : [w(n)](<w) --> w such that every finite
set can be written in at most 2(n) - 1 ways as the union of two distin
ct monocolored sets. If GCH holds, for every such coloring there isa f
inite set that can be written at least [GRAPHICS] ways as the union of
two sets with the same color.