Polychromatic Colorings of n-Dimensional Guillotine-Partitions

A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors appearing on its corners. A guillotine-partition is obtained by starting with a single axis-parallel hyperbox and recursively cutting a hyperbox of the partition into two hyperboxes by a hyperplane orthogonal to one of the n axes. We prove that there is a strong hyperbox-respecting coloring of any n-dimensional guillotine-partition. This theorem generalizes the result of Horev et al. [8] who proved the 2-dimensional case. This problem is a special case of the n-dimensional variant of polychromatic colorings. The proof gives an efficient coloring algorithm as well.

• Type: Conference
• Year: 2008
• Where: COCOON
• Authors: Balázs Keszegh
• Keywords: COCOON 2008, Combinatorics, Efficient Coloring Algorithm, N-dimensional Hyperbox Partition, Strong Hyperbox-respecting Coloring