Timeline for Coloring Points in the Plane
Current License: CC BY-SA 2.5
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2012 at 9:49 | answer | added | Dima Pasechnik | timeline score: 0 | |
| Jun 30, 2010 at 17:45 | comment | added | Timothy Chow | In my opinion it is somewhat misleading to say that "the answer may depend on the axioms of set theory." If we assume the axiom of choice then we can use a compactness argument to prove that the chromatic number of the plane is equal to the maximum chromatic number of a finite unit-distance planar graph. In the absence of the axiom of choice, these two numbers aren't necessarily equal so there are two separate questions here. But if you accept the axiom of choice, as most mathematicians do, I don't think there is any evidence that the answer is independent of ZFC. | |
| Jun 30, 2010 at 16:41 | answer | added | Oguz Kurt | timeline score: 1 | |
| Feb 3, 2010 at 8:11 | history | edited | Konrad Swanepoel |
edited tags
|
|
| Feb 3, 2010 at 8:10 | comment | added | Konrad Swanepoel | Alexander Soifer's "The Mathematical Coloring Book" contains a lot of history on this problem. There is some recent research of Soifer, Shelah and others that suggest the answer may depend on the axioms of set theory. | |
| Feb 3, 2010 at 6:34 | vote | accept | Richard Dore | ||
| Feb 3, 2010 at 6:32 | comment | added | Jonas Meyer | The second link Googling "Coloring Points in the Plane" led me to Mariano's answer. This shows you picked a good title! | |
| Feb 3, 2010 at 6:29 | answer | added | Mariano Suárez-Álvarez | timeline score: 9 | |
| Feb 3, 2010 at 6:28 | answer | added | Yemon Choi | timeline score: 5 | |
| Feb 3, 2010 at 6:27 | history | edited | Richard Dore | CC BY-SA 2.5 |
deleted 23 characters in body
|
| Feb 3, 2010 at 6:20 | history | asked | Richard Dore | CC BY-SA 2.5 |