Nowhere dense Ramsey sets
Combinatorics
2025-08-11 v2
Abstract
A set of points in Euclidean space is called \textit{Ramsey} if any finite partition of yields a monochromatic copy of . While characterization of Ramsey set remains a major open problem in the area, a stronger ``density'' concept was considered in [J. Amer. Math. Soc. 3, 1--7, 1990]: If is a -dimensional simplex, then for any there is an integer and finite configuration such that any subconfiguration with contains a copy of . Complementing this, here we show the existence of and of an infinite configuration with the property that any finite coloring of yields a monochromatic copy of , yet for any finite set of points contains a subset of size without a copy of .
Cite
@article{arxiv.2402.17137,
title = {Nowhere dense Ramsey sets},
author = {Vojtěch Rödl and Marcelo Sales},
journal= {arXiv preprint arXiv:2402.17137},
year = {2025}
}
Comments
Comments are welcome