Answer by Alex Ravsky for Rainbow covering by rectangles
I am impressed by your problem inventiveness.For each natural $k$ let $n(k)$ be the smallest $n$ for which a rainbow covering always exists.Proposition.$n(k)\le k(k+1)/2$.Consider first a...
View ArticleRainbow covering by rectangles
There are $n$ coverings of the unit square, each of which contains $k$ axes-parallel rectangles of a unique color.Define a rainbow covering as a covering of the unit square that contains exactly one...
View Article
More Pages to Explore .....
