Timeline for The Problem about 2-coloring finite plane
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2012 at 11:19 | comment | added | WangYao | @Douglas Zare. I am not very familiar with this field. Thanks for the "convention " explanation, my poor english is not able to manifest this clear | |
| Feb 21, 2012 at 10:59 | vote | accept | WangYao | ||
| Feb 21, 2012 at 11:16 | |||||
| Feb 21, 2012 at 10:59 | vote | accept | WangYao | ||
| Feb 21, 2012 at 10:59 | |||||
| Feb 21, 2012 at 10:58 | vote | accept | WangYao | ||
| Feb 21, 2012 at 10:59 | |||||
| Feb 20, 2012 at 23:27 | comment | added | Douglas Zare | Yes, that is the convention in this type of problem. By the way, it's not immediately obvious that there is a sufficient size at all. This is an application of Gallai's Theorem, but the proofs tend to give absurdly large bounds. | |
| Feb 20, 2012 at 23:20 | comment | added | Gerhard Paseman | As the upper left 3x3 array shows, it is required that the squares have their edges aligned with the rows and columns of the array. Gerhard "Ask Me About Slanted Views" Paseman, 2012.02.20 | |
| Feb 20, 2012 at 22:57 | history | answered | Douglas Zare | CC BY-SA 3.0 |