Related papers: Effectiveness of Hindman's theorem for bounded sum…

A proper coloring $c$ of a simple graph $G$ is harmonious if, for every pair of distinct edges $uv,xy\in E(G)$, we have that $\{c(u),c(v)\}\neq \{c(x),c(y)\}$. The harmonious chromatic number of $G$, denoted by $h(G)$, is the least positive…

We construct for every integer $k\geq 3$ and every real $\mu\in(0, \frac{k-1}{k})$ a set of integers $X=X(k, \mu)$ which, when coloured with finitely many colours, contains a monochromatic $k$-term arithmetic progression, whilst every…

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…

We prove that for any $r\in \mathbb{N}$, there exists a constant $C_r$ such that the following is true. Let $\mathcal{F}=\{F_1,F_2,\dots\}$ be an infinite sequence of bipartite graphs such that $|V(F_i)|=i$ and $\Delta(F_i)\leq \Delta$ hold…

Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…

The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the…

In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…

The thin set theorem for $n$-tuples and $k$ colors ($\mathsf{TS}^n_k$) states that every $k$-coloring of $[\mathbb{N}]^n$ admits an infinite set of integers $H$ such that $[H]^n$ avoids at least one color. In this paper, we study the…

Let $X$ be a (repetitive) infinite connected simple graph with a finite upper bound $\Delta$ on the vertex degrees. The main theorem states that $X$ admits a (repetitive) limit aperiodic vertex coloring by $\Delta$ colors. This refines a…

Chromatic quantum contextuality is a criterion of quantum nonclassicality based on (hyper)graph coloring constraints. If a quantum hypergraph requires more colors than the number of outcomes per maximal observable (context), it lacks a…

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…

Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this paper, we analyze Fekete's lemma in view of the arithmetical…

For a positive integer $k$ and a graph $H$, the $k$-color induced size-Ramsey number $\hat{R}_{\mathrm{ind}}(H, k)$ is the minimum integer $m$ for which there exists a graph $G$ with $m$ edges such that for every $k$-edge coloring of $G$,…

P. Kirchberger proved that, for a finite subset $X$ of $\mathbb{R}^{d}$ such that each point in $X$ is painted with one of two colors, if every $d+2$ or fewer points in $X$ can be separated along the colors, then all the points in $X$ can…

A countable structure is indivisible if for every coloring with finite range there is a monochromatic isomorphic subcopy of the structure. Each indivisible structure naturally corresponds to an indivisibility problem which outputs such a…

We prove two colorful Carath\'eodory theorems for strongly convex hulls, generalizing the colorful Carat\'eodory theorem for ordinary convexity by Imre B\'ar\'any, the non-colorful Carath\'eodory theorem for strongly convex hulls by the…

The main result of this paper is the proof of the simultaneous consistency, modulo a weakly compact cardinal, of the equality $2^{< \mathfrak{c}} = \mathfrak{c}$ with the following property (*) of partitions of pairs of $\mathfrak{c}$:…

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

We show a slightly simpler proof the following theorem by I. Dinur, O. Regev, and C. Smyth: for all $c \geq 2$, it is NP-hard to find a $c$-colouring of a 2-coloruable 3-uniform hypergraph. We recast this result in the algebraic framework…

Hadwiger's conjecture asserts that every graph without a $K_t$-minor is $(t-1)$-colorable. It is known that the exact version of Hadwiger's conjecture does not extend to list coloring, but it has been conjectured by Kawarabayashi and Mohar…