Monochromatic boxes in colored grids

Details Monochromatic boxes in colored grids Monochromatic boxes in colored grids

2008-10-16

arxiv.org/abs/0810.3019v1

Mathematics

Combinatorics

17 pages, 1 figure

Scientific paper

A $d$-dimensional grid is a set of the form $R = [a_1] \times ... \times [a_d]$. A $d$-dimensional box is a set of the form $\{b_1,c_1\} \times ... \times \{b_d,c_d\}$. When a grid is $c$-colored, must it admit a monochromatic box? If so, we say that $R$ is $c$-guaranteed. This question is a relaxation of one attack on bounding the van der Waerden numbers, and also arises as a natural hypergraph Ramsey problem (viz. the Ramsey numbers of hyperoctahedra). We give conditions on the $a_i$ for $R$ to be $c$-guaranteed that are asymptotically tight, and analyze the set of minimally $c$-guaranteed grids.

Affiliated with

Also associated with

No associations

Rating

Monochromatic boxes in colored grids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Monochromatic boxes in colored grids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Monochromatic boxes in colored grids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-351575