Related papers: Partition theorems for Ketonen-Solovay largeness

In this series of papers we advance Ramsey theory of colorings over partitions. In this part, we concentrate on anti-Ramsey relations, or, as they are better known, strong colorings, and in particular solve two problems from [CKS21]. It is…

Recently Sober\'on proved a far-reaching generalization of the colorful KKM Theorem due to Gale: let $n\geq k$, and assume that a family of closed sets $(A^i_j\mid i\in [n], j\in [k])$ has the property that for every $I\in…

A partition of a (hyper)graph is $\varepsilon$-homogenous if the edge densities between almost all clusters are either at most $\varepsilon$ or at least $1-\varepsilon$. Suppose a $3$-graph has the property that the link of every vertex has…

We demonstrate that for every positive integer $\Delta$, every K\_4-minor-free graph with maximum degree $\Delta$ admits an equitable coloring with k colors wherek $\ge$ ($\Delta$+3)/2. This bound is tight and confirms a conjecture by Zhang…

This note shows how recent work of Eskew and Hayut can be combined with a method of Raghavan and Shelah to show the consistency of $\mathfrak u_\kappa<2^\kappa$ for $\aleph_3\leq \kappa<\aleph_{\omega}$, from a huge cardinal.

A $k$-wise $\ell$-divisible set family is a collection $\mathcal{F}$ of subsets of ${ \{1,\ldots,n \} }$ such that any intersection of $k$ sets in $\mathcal{F}$ has cardinality divisible by $\ell$. If $k=\ell=2$, it is well-known that…

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

We establish upper bounds on the size of the largest subset of $\{1,2,\dots,N\}$ lacking nonzero differences of the form $h(p_1,\dots,p_{\ell})$, where $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ is a fixed polynomial satisfying appropriate…

A linear configuration is said to be common in a finite Abelian group $G$ if for every 2-coloring of $G$ the number of monochromatic instances of the configuration is at least as large as for a randomly chosen coloring. Saad and Wolf…

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…

We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…

A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…

We present an explicit family of hypergraphs with arbitrarily large uniformity and chromatic number that admit realizations in both geometric and number-theoretic settings. As an application, we give a new proof of a theorem of Chen, Pach,…

We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show…

Given $\eta \in [0, 1]$, a colouring $C$ of $V(G)$ is an $\eta$-majority colouring if at most $\eta d^+(v)$ out-neighbours of $v$ have colour $C(v)$, for any $v \in V(G)$. We show that every digraph $G$ equipped with an assignment of lists…

We consider the IVP associated to the generalized KdV equation with low degree of non-linearity \begin{equation*} \partial_t u + \partial_x^3 u \pm |u|^{\alpha}\partial_x u = 0,\; x,t \in \mathbb{R},\;\alpha \in (0,1). \end{equation*} By…

We prove that for every number k each countable infinite group $G$ admits a partition $G=A\cup B$ into two sets which are $k$-meager in the sense that for every $k$-element subset $K\subset G$ the sets $KA$ and $KB$ are not thick. The proof…

Consider a graph $G$ on $n$ vertices with $\alpha \binom{n}{2}$ edges which does not contain an induced $K_{2, t}$ ($t \geqslant 2$). How large does $\alpha$ have to be to ensure that $G$ contains, say, a large clique or some fixed subgraph…

Let $p_{-t}(n)$ denote the number of partitions of $n$ into $t$ colors. In analogy with Ramanujan's work on the partition function, Lin recently proved in \cite{Lin} that $p_{-3}(11n+7)\equiv0\pmod{11}$ for every integer $n$. Such…