Timeline for The Problem about 2-coloring finite plane
Current License: CC BY-SA 3.0
13 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Feb 21, 2012 at 11:16 | vote | accept | WangYao | ||
S Feb 21, 2012 at 10:59 | vote | accept | WangYao | ||
S Feb 21, 2012 at 11:16 | |||||
Feb 21, 2012 at 10:59 | vote | accept | WangYao | ||
S Feb 21, 2012 at 10:59 | |||||
Feb 21, 2012 at 10:59 | vote | accept | WangYao | ||
Feb 21, 2012 at 10:59 | |||||
S Feb 21, 2012 at 10:59 | vote | accept | WangYao | ||
Feb 21, 2012 at 10:59 | |||||
Feb 21, 2012 at 10:58 | vote | accept | WangYao | ||
S Feb 21, 2012 at 10:59 | |||||
Feb 21, 2012 at 9:11 | answer | added | Roland Bacher | timeline score: 9 | |
Feb 20, 2012 at 23:33 | comment | added | Boris Bukh | It seems that you are asking about $K_{k,k}$ case of Zarankiewicz problem (if you want a square only in blue). Otherwise, you basically ask about the bipartite Ramsey number $R(K_{k,k},K_{k,k}). This should give you enough of keywords to search for. | |
Feb 20, 2012 at 22:57 | answer | added | Douglas Zare | timeline score: 4 | |
Feb 20, 2012 at 22:11 | comment | added | Gerry Myerson | A variant of this problem is discussed at cstheory.stackexchange.com/questions/791/… | |
Feb 20, 2012 at 21:59 | comment | added | Gerry Myerson | The figure also shows a combinatorial $4\times4$ square filled by ones, the 4 rows and the 1st, 3rd, 5th, and 6th columns. On the other hand, it's not an $X\times X$ plane, unless one $X$ is 4 and the other $X$ is 6. I'm assuming a combinatorial square is an arbitrary selection of $k$ rows and $k$ columns. | |
Feb 20, 2012 at 18:58 | comment | added | Will Sawin | The definition of combinatorial square seems confusing. Do you mean to say that the row and column indices of the points of the square form arithmetic progressions, with arbitrary spacing? Must the spacing be the same in the two coordinates? | |
Feb 20, 2012 at 18:36 | history | asked | WangYao | CC BY-SA 3.0 |