An Analogue of Gromov's Waist Theorem for Coloring the Cube

被引:4
|
作者
Karasev, R. N. [1 ,2 ,3 ]
机构
[1] Moscow Inst Phys & Technol, Dept Math, Dolgoprudnyi 141700, Russia
[2] RAS, Inst Informat Transmiss Problems, Moscow 127994, Russia
[3] Yaroslavl State Univ, Lab Discrete & Computat Geometry, Yaroslavl 150000, Russia
关键词
Graph coloring; Covering dimension; Waist inequality; POINT THEOREM;
D O I
10.1007/s00454-013-9490-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
It is proved that if we partition a d-dimensional cube into small cubes and color the small cubes in colors then there exists a monochromatic connected component consisting of at least small cubes. Another proof of this result is given in Matdinov's preprint (Size of components of a cube coloring, arXiv:1111.3911, 2011).
引用
收藏
页码:444 / 453
页数:10
相关论文
共 50 条
  • [1] An Analogue of Gromov’s Waist Theorem for Coloring the Cube
    R. N. Karasev
    [J]. Discrete & Computational Geometry, 2013, 49 : 444 - 453
  • [2] ON GROMOV'S WAIST OF THE SPHERE THEOREM
    Memarian, Yashar
    [J]. JOURNAL OF TOPOLOGY AND ANALYSIS, 2011, 3 (01) : 7 - 36
  • [3] Gromov's Centralizer Theorem
    A. Candel
    R. Quiroga-Barranco
    [J]. Geometriae Dedicata, 2003, 100 : 123 - 155
  • [4] Gromov's centralizer theorem
    Candel, A
    Quiroga-Barranco, R
    [J]. GEOMETRIAE DEDICATA, 2003, 100 (01) : 123 - 155
  • [5] A direct proof of Gromov's theorem
    Burago Y.D.
    Malev S.G.
    Novikov D.I.
    [J]. Journal of Mathematical Sciences, 2009, 161 (3) : 361 - 367
  • [6] On certain quantifications of Gromov's nonsqueezing theorem
    Sackel, Kevin
    Song, Antoine
    Varolgunes, Umut
    Zhu, Jonathan J.
    Brendel, Joe
    [J]. GEOMETRY & TOPOLOGY, 2024, 28 (03) : 1113 - 1152
  • [7] BOUNDS FOR CUBE COLORING
    PLUMSTEAD, BR
    PLUMSTEAD, JB
    [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (01): : 73 - 78
  • [8] RAINBOW COLORING THE CUBE
    FAUDREE, RJ
    GYARFAS, A
    LESNIAK, L
    SCHELP, RH
    [J]. JOURNAL OF GRAPH THEORY, 1993, 17 (05) : 607 - 612
  • [9] Tverberg’s Theorem and Graph Coloring
    Alexander Engström
    Patrik Norén
    [J]. Discrete & Computational Geometry, 2014, 51 : 207 - 220
  • [10] Tverberg's Theorem and Graph Coloring
    Engstrom, Alexander
    Noren, Patrik
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2014, 51 (01) : 207 - 220