Size of components of a cube coloring

DOI10.1007/S00454-013-9504-2zbMATH Open1269.05039arXiv1111.3911OpenAlexW1977741896MaRDI QIDQ2391835FDOQ2391835

Authors: Marsel Matdinov 

Publication date: 5 August 2013

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Suppose a d-dimensional lattice cube of size n^d is colored in several colors so that no face of its triangulation (subdivision of the standard partition into n^d small cubes) is colored in m+2 colors. Then one color is used at least f(d,m)*n^(d-m) times.

Full work available at URL: https://arxiv.org/abs/1111.3911

Recommendations

• An analogue of Gromov's waist theorem for coloring the cube
• Polychromatic Colorings of Subcubes of the Hypercube
• Linear polychromatic colorings of hypercube faces
• Linear \(d\)-polychromatic \(Q_{d-1}\)-colorings of the hypercube
• Large Monochromatic Components in Two-colored Grids

zbMATH Keywords

latticepartitiontriangulationcubeskeleton

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Dimension theory in general topology (54F45)

Cites Work

• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• An analogue of Gromov's waist theorem for coloring the cube
• Large Monochromatic Components in Two-Colored Grids

Cited In (5)

• Colouring strong products
• Lower and upper bounds for the waists of different spaces
• Waist of maps measured via Urysohn width
• An analogue of Gromov's waist theorem for coloring the cube
• Linear polychromatic colorings of hypercube faces

This page was built for publication: Size of components of a cube coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391835)