Large Monochromatic Components in Two-Colored Grids

DOI10.1137/070684112zbMath1159.05021OpenAlexW1981254886MaRDI QIDQ3614208

Aleš Přívétivý, Ji{ří} Matoušek

Publication date: 16 March 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070684112

zbMATH Keywords

isoperimetric inequalitygraph coloringd-dimensional grid with diagonalsHEX Lemmamonochromatic connected subgraphtriangulated square grid

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Clustered 3-colouring graphs of bounded degree ⋮ Size of components of a cube coloring ⋮ An analogue of Gromov's waist theorem for coloring the cube ⋮ Lower and upper bounds for the waists of different spaces

This page was built for publication: Large Monochromatic Components in Two-Colored Grids