Size of components of a cube coloring
Abstract
Suppose a d-dimensional lattice cube of size nd is colored in several colors so that no face of its triangulation (subdivision of the standard partition into nd small cubes) is colored in m+2 colors. Then one color is used at least f(d,m)*n(d-m) times.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.