Large Monochromatic Components in Two-colored Grids

DOI10.1016/J.ENDM.2007.07.002MaRDI QIDQ3503446zbMATH OpenOpenAlexFDO

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

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.07.002

zbMATH Keywords

graph coloringHEX lemmaseparator

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Large Monochromatic Components in Two-Colored Grids
• Highly connected monochromatic subgraphs
• Monochromatic boxes in colored grids
• scientific article; zbMATH DE number 2145230
• Highly connected monochromatic subgraphs of two-colored complete graphs

Cites work

• Bounded size components -- partitions and transversals.
• Compressions and isoperimetric inequalities
• Edge-isoperimetric inequalities in the grid
• Generalization of a Probability Limit Theorem of Cramer
• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• scientific article; zbMATH DE number 1151379 (Why is no real title available?)
• Low diameter graph decompositions
• Partitioning into graphs with only small components
• The Game of Hex and the Brouwer Fixed-Point Theorem

Cited in

(5)

• An analogue of Gromov's waist theorem for coloring the cube
• Size of components of a cube coloring
• Monochromatic boxes in colored grids
• Large Monochromatic Components in Two-Colored Grids
• scientific article; zbMATH DE number 2145230 (Why is no real title available?)

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

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