Timeline for For a partition of $\mathbb{R}$ into countably infinite sets, must there be an almost-disjoint family of $2^{\frak c}$ many selectors?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Mar 21, 2015 at 5:54 | comment | added | bof | Under GCH this is Problem 19/A in the old "Unsolved problems in set theory" paper of P. Erdős and A. Hajnal. | |
| Mar 21, 2015 at 5:20 | answer | added | Péter Komjáth | timeline score: 7 | |
| Mar 20, 2015 at 17:22 | answer | added | Eric Wofsey | timeline score: 4 | |
| Mar 20, 2015 at 14:47 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
countably infinite
|
| Mar 20, 2015 at 14:27 | history | asked | Joel David Hamkins | CC BY-SA 3.0 |