New answers tagged graph-colorings
0
votes
$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?
In order for Bob to win, he needs that at least $\delta n$ columns have values at least $\delta n$ each. So Alice just needs to shuffle the colors to prevent this.
In other words, we need $n$ subsets ...
Top 50 recent answers are included
Related Tags
graph-colorings × 565graph-theory × 476
co.combinatorics × 299
hypergraph × 47
reference-request × 38
infinite-combinatorics × 32
algorithms × 28
set-theory × 27
computational-complexity × 23
extremal-graph-theory × 20
discrete-geometry × 19
ramsey-theory × 17
matching-theory × 14
perfect-matchings × 10
cayley-graphs × 10
combinatorial-optimization × 9
chromatic-polynomial × 9
bipartite-graphs × 8
graph-minors × 8
lo.logic × 7
pr.probability × 6
directed-graphs × 6
mg.metric-geometry × 5
polynomials × 5
lattices × 5