Related papers: Continuous Ramsey theory on Polish spaces and cove…
In this short note we prove that there is a constant $c$ such that every k-edge-coloring of the complete graph K_n with n > 2^{ck} contains a K_4 whose edges receive at most two colors. This improves on a result of Kostochka and Mubayi, and…
The Lov\'asz Local Lemma is a powerful probabilistic technique for proving the existence of combinatorial objects. It is especially useful for colouring graphs and hypergraphs with bounded maximum degree. This paper presents a general…
We provide multicolored and infinite generalizations for a Ramsey-type problem raised by Bollob\'as, concerning colorings of $K_n$ where each color is well-represented. Let $\chi$ be a coloring of the edges of a complete graph on $n$…
We consider the problem of $2$-coloring geometric hypergraphs. Specifically, we show that there is a constant $m$ such that any finite set of points in the plane $\mathcal{S} \subset {\mathbb R}^2$ can be $2$-colored such that every…
We show that it is consistent relative to the existence of suitable large cardinals that for any countable-to-one coloring $c: [\omega_2]^2\to \omega_2$, there exists a closed subset $A\subseteq \omega_2$ of order type $\omega_1$ such that…
We prove that the coindex of the box complex $\mathrm{B}(H)$ of a graph $H$ can be measured by the generalised Mycielski graphs which admit a homomorphism to it. As a consequence, we exhibit for every graph $H$ a system of linear equations…
We introduce the concept of finitely coloured equivalence for unital *-homomorphisms between C*-algebras, for which unitary equivalence is the 1-coloured case. We use this notion to classify *-homomorphisms from separable, unital, nuclear…
We answer a question posed by Hirschfeldt and Jockusch by showing that whenever $k > \ell$, Ramsey's theorem for singletons and $k$-colorings, $\mathsf{RT}^1_k$, is not strongly computably reducible to the stable Ramsey's theorem for…
For a fixed graph $H$, what is the smallest number of colours $C$ such that there is a proper edge-colouring of the complete graph $K_n$ with $C$ colours containing no two vertex-disjoint colour-isomorphic copies, or repeats, of $H$? We…
The field of descriptive combinatorics investigates the question, to what extent can classical combinatorial results and techniques be made topologically or measure-theoretically well-behaved? This paper examines a class of coloring…
We give a negative answer to a question of Erdos and Hajnal: it is consistent that GCH holds and there is a colouring $c:[{\omega_2}]^2\to 2$ establishing $\omega_2 \not\to [(\omega_1;{\omega})]^2_2$ such that some colouring…
Milnor proved two uniqueness theorems for axiomatic (co)homology: one for pairs of compacta (1960) and another, in particular, for pairs of countable simplicial complexes (1961). We obtain their common generalization: the Eilenberg-Steenrod…
A matching $M$ in a graph $G$ is connected if all the edges of $M$ are in the same component of $G$. Following \L uczak,there have been many results using the existence of large connected matchings in cluster graphs with respect to regular…
In this paper, two outwardly different graphs, namely, the zero divisor graph $\Gamma(C_c(X))$ and the comaximal graph $\Gamma_2^{'}(C_c(X))$ of the ring $C_c(X)$ of all real-valued continuous functions having countable range, defined on…
An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…
We prove that for every colouring of pairs of reals with finitely-many colours, there is a set homeomorphic to the rationals which takes no more than two colours. This was conjectured by Galvin in 1970, and a colouring of Sierpi{\'n}ski…
In this paper, we study the problem of computing a homotopy from a planar curve $C$ to a point that minimizes the area swept. The existence of such a minimum homotopy is a direct result of the solution of Plateau's problem. Chambers and…
We describe the second homotopy group of any CW-complex $K$ by analyzing the universal cover of a locally finite model of $K$ using the notion of $G$-coloring of a partially ordered set. As applications we prove a generalization of the…
A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of…
The notions of shyness and prevalence generalize the property of being zero and full Haar measure to arbitrary (not necessarily locally compact) Polish groups. The main goal of the paper is to answer the following question: What can we say…