Strong colorings without nontrivial polychromatic sets
Seminar
Speaker
Michal Machura
Date
08/12/2013 - 10:10Add to Calendar
2013-12-08 10:10:00
2013-12-08 10:10:00
Strong colorings without nontrivial polychromatic sets
Michal shall prove Shelah's thereom that the Continuum Hypothesis entails a coloring c:[w1]2-->w such that c``[A]2=w for every uncountable subset A of w1, and yet c admits no 3-sized set X on which c|[X]2 is one-to-one.
Lecture notes
אוניברסיטת בר-אילן - Department of Mathematics
mathoffice@math.biu.ac.il
Asia/Jerusalem
public
Abstract
Michal shall prove Shelah's thereom that the Continuum Hypothesis entails a coloring c:[w1]2-->w such that c``[A]2=w for every uncountable subset A of w1, and yet c admits no 3-sized set X on which c|[X]2 is one-to-one.
Last Updated Date : 05/12/2013
