Related papers: Metrically Ramsey ultrafilters
A coloring of a matroid is proper if elements of the same color form an independent set. For a loopless matroid M, its chromatic number \chi(M) is the minimum number of colors that suffices to color properly the ground set E of M. In this…
A characterization of finite homogeneous ultrametric spaces and finite ultrametric spaces generated by unrooted labeled trees is found in terms of representing trees. A characterization of finite ultrametric spaces having perfect strictly…
We develop a transfer principle of structural Ramsey theory from finite structures to ultraproducts. We show that under certain mild conditions, when a class of finite structures has finite small Ramsey degrees, under the (Generalized)…
Given a natural $n$, we construct a two-coloring of $\mathbb{R}^n$ with the maximum metric satisfying the following. For any finite set of reals $S$ with diameter greater than $5^{n}$ such that the distance between any two consecutive…
Let $(M,d)$ be a bounded countable metric space and $c>0$ a constant, such that $d(x,y)+d(y,z)-d(x,z) \ge c$, for any pairwise distinct points $x,y,z$ of $M$. For such metric spaces we prove that they can be isometrically embedded into any…
This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such…
Two non-empty sets $A,B$ of a metric space $(X,d)$ are called parallel if $d(a,B)=d(A,B)=d(A,b)$ for any points $a\in A$ and $b\in B$. Answering a question posed on Mathoverflow, we prove that for a cover $\mathcal C$ of a metrizable space…
A mapping $f:X\to Y$ between metric spaces is called \emph{little Lipschitz} if the quantity $$ \operatorname{lip}(f(x)=\liminf_{r\to0}\frac{\operatorname{diam} f(B(x,r))}{r} $$ is finite for every $x\in X$. We prove that if a compact (or,…
Given a graph $G$, its Ramsey number $r(G)$ is the minimum $N$ so that every two-coloring of $E(K_N)$ contains a monochromatic copy of $G$. It was conjectured by Conlon, Fox, and Sudakov that if one deletes a single vertex from $G$, the…
In this short paper, we will show that the space of real valued uniformly continuous functions defined on a metric space $(X,d)$ is a ring if and only if every subset $A\subset X$ has one of the following properties: $A$ is…
N. Hindman, I. Leader and D. Strauss proved that it is consistent that there is a finite colouring of $\mathbb R$ so that no infinite sumset $X+X=\{x+y:x,y\in X\}$ is monochromatic. Our aim in this paper is to prove a consistency result in…
We prove the existence of a finitely dependent proper colouring of the integer lattice Z^d that is fully isometry-invariant in law, for all dimensions d. Previously this was known only for d=1, while only translation-invariant examples were…
We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…
We introduce natural strengthenings of sequential compactness called the $r$-Ramsey property for each natural number $r\geq 1$. We prove that metrizable compact spaces are $r$-Ramsey for all $r$ and give examples of compact spaces that are…
Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet $X$ and output alphabet $Y$ can be naturally endowed with the quotient of the Euclidean topology by the…
A well-known result of R\"odl and Ruci\'nski states that for any graph $H$ there exists a constant $C$ such that if $p \geq C n^{- 1/m_2(H)}$, then the random graph $G_{n,p}$ is a.a.s. $H$-Ramsey, that is, any $2$-colouring of its edges…
We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of $\mathbb{N}$ there is an infinite set $A$ and an as large as desired finite set $B$…
An ultrametric preserving function $f$ is said to be strongly ultrametric preserving if ultrametrics $d$ and $f \circ d$ define the same topology on $X$ for each ultrametric space $(X,d)$. The set of all strongly ultrametric preserving…
We show that for $m, r \in \mathbb{N}$ and $N > (2m+1)^r (r!)^{1/m}$, every $r$-coloring of the integers in the interval $[N]$ contains a monochromatic solution to the equation \[ x_1 + \dots + \dots x_{m+1} = y_1 + \dots + y_m. \] This…
In ``Characterization, stability and convergence of hierarchical clustering methods'' by G. E. Carlsson, F. Memoli, the natural way to construct an ultrametric space from a given metric space was presented. It was shown that the…