Timeline for $n^2$-Grid $3n$-Coloring Game: Can we color a n-square grid with 3n colors s. t. we can't select n colors to get an histogram with $\Theta(n^2)$ area?
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 28, 2022 at 10:10 | comment | added | Ilya Bogdanov | But it seems to me that the real score Bob always can achieve is around $n\mathop{\mathrm{polylog}}n$... | |
| Apr 28, 2022 at 10:02 | history | answered | Ilya Bogdanov | CC BY-SA 4.0 |