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

DOI10.4310/JOC.2014.V5.N4.A3MaRDI QIDQ2345758zbMATH OpenFDO

Authors Jeremy F. Alm

Publication date 20 May 2015

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.3154

zbMATH Keywords

combinatorial geometryGallai's theoremhomothetyinfinite cardinal

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Ramsey theory (05D10) Erd?s problems and related topics of discrete geometry (52C10)

Abstract: We generalize a result of Tibor Gallai as follows: for any finite set of points $mathcalS$ in the plane, if the plane is colored in finitely many colors, then there exist $2^{alep{h}_0}$ monochromatic subsets of the plane homothetic to $mathcalS$. Furthermore, we prove an even stronger result for $n$-dimensional Euclidean space.

Recommendations

• Toward an uncountable analogue of Gallai's theorem for colorings of the plane
• scientific article; zbMATH DE number 866014
• scientific article; zbMATH DE number 866019
• A Ramsey-Type Theorem in the Plane
• scientific article; zbMATH DE number 496012

Cited in

(4)

• Some coloring properties for uncountable cardinals
• An infinite color analogue of Rado's theorem
• Toward an uncountable analogue of Gallai's theorem for colorings of the plane
• Proof of a conjecture of Galvin

This page was built for publication: An infinite cardinal version of Gallai's theorem for colorings of the plane

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