Graph coloring with no large monochromatic components

N. Linial, J. Matousek, O. Sheffet +1

For a graph G and an integer t we let mcc_t(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having…