An infinite cardinal version of Gallai's Theorem for colorings of the plane

Abstract

We generalize a result of Tibor Gallai as follows: for any finite set of points S in the plane, if the plane is colored in finitely many colors, then there exist 20 monochromatic subsets of the plane homothetic to S. Furthermore, we prove an even stronger result for n-dimensional Euclidean space.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…