Timeline for The Problem about 2-coloring finite plane
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2012 at 11:17 | comment | added | WangYao | @Bacher Excellent paper and very good result. Congrats. I am thinking a problem similar and think the general k×k cases where the square is given by S_k1 \times S_k2 where S_k1 is the subset of columns and s_k2 is the subset of subset of rows. But since finding 15 is so hard. This is an application of Gallai's Theorem, but the proofs tend to give absurdly large bounds I am finding the proof. Thank you. – WangYao 0 secs ago | |
| Feb 21, 2012 at 11:16 | vote | accept | WangYao | ||
| Feb 21, 2012 at 11:08 | history | edited | Gerry Myerson | CC BY-SA 3.0 |
improved formatting
|
| Feb 21, 2012 at 10:59 | vote | accept | WangYao | ||
| Feb 21, 2012 at 10:59 | |||||
| Feb 21, 2012 at 10:59 | vote | accept | WangYao | ||
| Feb 21, 2012 at 10:59 | |||||
| Feb 21, 2012 at 9:11 | history | answered | Roland Bacher | CC BY-SA 3.0 |