Related papers: Ramsey theory for monochromatically well-connected…
For a graph $G$, we denote by $\alpha(G)$ the size of a maximum independent set and by $\omega(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $\alpha$ and $\omega$, respectively. One…
This paper begins by exploring some old and new results about Ramsey numbers and minimum numbers of monochromatic triangles in $2$-colorings of complete graphs, both in the disjoint and non-disjoint cases. We then extend the theory, by…
Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F)…
This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
We study Ramsey's theorem for pairs and two colours in the context of the theory of $\alpha$-large sets introduced by Ketonen and Solovay. We prove that any $2$-colouring of pairs from an $\omega^{300n}$-large set admits an $\omega^n$-large…
In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…
Our main result is a robust generalisation of the Cockayne-Lorimer theorem on the multicolour Ramsey number of matchings. It is moreover a generalisation of the transference generalisation of Cockayne-Lorimer, which (informally) says that…
We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…
A subset $S$ of a cardinal $\kappa$ is Ramsey if for every function $f:[S]^{<\omega}\to \kappa$ with $f(a)<\min a$ for all $a\in[S]^{<\omega}$, there is a set $H\subseteq S$ of cardinality $\kappa$ which is \emph{homogeneous} for $f$,…
We associate ergodic properties to some subsets of the natural numbers. For any given family of subsets of the natural numbers one may study the question of occurrence of certain "algebraic patterns" in every subset in the family. By…
We develop a calculus for diagrams of knotted objects. We define Arrow presentations, which encode the crossing informations of a diagram into arrows in a way somewhat similar to Gauss diagrams, and more generally w-tree presentations,…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
Assume $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$. Let $\approx$ denote the relation of being in bijection. Let $\kappa \in \mathrm{ON}$ and $\langle E_\alpha : \alpha < \kappa\rangle$ be a sequence of equivalence relations on…
We consider a Ramsey statement for pairs of maps between trees, where one is an embedding as defined by Deuber and the other is a rigid surjection as defined by Solecki. We show that there is no Ramsey Theorem for pairs of maps where the…
A boundedly compact (boundedly weakly compact) m-connected (Menger-connected) set is shown to be monotone path-\allowbreak connected and is a sun in a broad class of Banach spaces (in particular, in separable spaces). Further, the…
We introduce the list colouring extension of classical Ramsey numbers. We investigate when the two Ramsey numbers are equal, and in general, how far apart they can be from each other. We find graph sequences where the two are equal and…
In this article, we prove that Ramsey's theorem for pairs and two colors is $\Pi^1_1$-conservative over~$\mathsf{RCA}_0 + \mathsf{B}\Sigma^0_2 + \mathsf{WF}(\epsilon_0)$ and over~$\mathsf{RCA}_0 + \mathsf{B}\Sigma^0_2 + \bigcup_n…
The relations of almost containedness and orthogonality in the lattice of groups of finitary permutations are studied in the paper. We define six cardinal numbers naturally corresponding to to these relations by the standard scheme of…