Toward an uncountable analogue of Gallai's theorem for colorings of the plane

Publication date 28 February 2013

Abstract: In this paper we prove that if

S

is any finite configuration of points in

m a t h b b Z^{2}

, then any finite coloring of

m a t h b b E^{2}

must contain uncountably many monochromatic subsets homothetic to

S

. We extend a result of Brown, Dunfield, and Perry on 2-colorings of

m a t h b b E^{2}

to any finite coloring of

m a t h b b E^{2}

.

Recommendations

Cited in

(5)

This page was built for publication: Toward an uncountable analogue of Gallai's theorem for colorings of the plane