Related papers: Nowhere dense Ramsey sets

Consider the Hales-Jewett theorem. The $k$-dimensional version of it tells us that the combinatorial space $\mathcal{U}_{M, \Lambda} = \{ \eta \mid \eta: M \to \Lambda \}$ has, under suitable assumptions, monochromatic $k$-dimensional…

Let X be a Noetherian space, let f be a continuous self-map on X, let Y be a closed subset of X, and let x be a point on X. We show that the set S consisting of all nonnegative integers n such that f^n(x) is in Y is a union of at most…

The study of symmetric structures is a new trend in Ramsey theory. Recently in [7], Di Nasso initiated a systematic study of symmetrization of classical Ramsey theoretical results, and proved a symmetric version of several Ramsey theoretic…

A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…

We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…

Let us denote by $\Phi(\lambda,\mu)$ the statement that $\mathbb{B}(\lambda) = D(\lambda)^\omega$, i.e. the Baire space of weight $\lambda$, has a coloring with $\mu$ colors such that every homeomorphic copy of the Cantor set $\mathbb{C}$…

In a seminal work, Cheng and Xu proved that for any positive integer \(r\), there exists an integer \(n_0\), independent of \(r\), such that every \(r\)-coloring of the \(n\)-dimensional Euclidean space \(\mathbb{E}^n\) with \(n \ge n_0\)…

For any $d\in \mathbb{N}$ and any function $f:(0,\infty)\to [0,1]$ with $f(R)\to 0$ as $R\to \infty$, we construct a set $A \subseteq \mathbb{R}^d$ and a sequence $R_n \to \infty$ such that $\|x-y\| \neq R_n$ for all $x,y\in A$ and…

In this paper we prove that if $S$ is any finite configuration of points in $\mathbb{Z}^2$, then any finite coloring of $\mathbb{E}^2$ must contain uncountably many monochromatic subsets homothetic to $S$. We extend a result of Brown,…

Fix integers $d,r\ge 2$ and suppose that the edge set of the $d$-fold Cartesian product of the $N$-clique $K_N^d$ is $r$-colored. We show that there is a copy of $K_n^d$ whose edges in each direction are monochromatic provided $N > 2^{2^{c…

Given a graph $H$, let $\chi_H(\mathbb{R}^n)$ be the smallest positive integer $r$ such that there exists an $r$-coloring of $\mathbb{R}^n$ with no monochromatic unit-copy of $H$, that is a set of $|V(H)|$ vertices of the same color such…

We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general $r$-uniform hypergraphs, it turns out that simply putting linear orders on their sets of vertices is not enough for this purpose: one…

Holmsen, Kyn\v{c}l and Valculescu recently conjectured that if a finite set $X$ with $\ell n$ points in $\mathbb{R}^d$ that is colored by $m$ different colors can be partitioned into $n$ subsets of $\ell$ points each, such that each subset…

Given a metric space $\mathcal{M}$ that contains at least two points, the chromatic number $\chi\left(\mathbb{R}^n_{\infty}, \mathcal{M} \right)$ is defined as the minimum number of colours needed to colour all points of an $n$-dimensional…

An $r$-uniform hypergraph $H$ is semi-algebraic of complexity $\mathbf{t}=(d,D,m)$ if the vertices of $H$ correspond to points in $\mathbb{R}^{d}$, and the edges of $H$ are determined by the sign-pattern of $m$ degree-$D$ polynomials.…

We introduce the notion of a {\it semi-retraction}. Given two structures $\A$ and $\B$, $\A$ is a semi-retraction of $\B$ if there exist quantifier-free type respecting maps $f: \B \raw \A$ and $g: \A \raw \B$ such that $f \circ g$ is an…

In this paper, we introduce Euclidean Gallai-Ramsey theory, by combining Euclidean Ramsey theory and Gallai-Ramsey theory on graphs. More precisely, we consider the following problem: For an integer $r$ and configurations $K$ and $K'$, does…

Given a countable set S of positive reals, we study finite-dimensional Ramsey-theoretic properties of the countable ultrametric Urysohn space with distances in S.

An important theme of recent research in Ramsey theory has been establishing pseudorandomness properties of Ramsey graphs. An $N$-vertex graph is called $C$-Ramsey if it has no homogeneous set of size $C\log N$. A theorem of Bukh and…

A graph $H$ is common if its Ramsey multiplicity, i.e., the minimum number of monochromatic copies of $H$ contained in any $2$-edge-coloring of $K_n$, is asymptotically the same as the number of monochromatic copies in the random…