Timeline for What is the fewest number of points you must delete from $\mathbb{R}^3$ to make it not simply connected?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2019 at 16:52 | comment | added | Taras Banakh | @AlexRavsky Yes, you are right. $B$ should be a subset of $C$. | |
| Jul 8, 2019 at 16:51 | history | edited | Taras Banakh | CC BY-SA 4.0 |
edited body
|
| Jul 3, 2019 at 1:13 | comment | added | Alex Ravsky | I guess you mean the 3-element subset $B$ of $C$, not of $S$. | |
| Sep 1, 2015 at 15:39 | history | edited | Taras Banakh | CC BY-SA 3.0 |
There was a gap in the previous proof. So, an alternative proof is presented.
|
| Sep 1, 2015 at 15:07 | history | edited | Taras Banakh | CC BY-SA 3.0 |
fixed a misprint
|
| Sep 1, 2015 at 12:06 | history | answered | Taras Banakh | CC BY-SA 3.0 |