相关论文: An exponential-type upper bound for Folkman number…

For a graph $G$ the expression $G \overset{v}{\rightarrow} (a_1, ..., a_s)$ means that for any $s$-coloring of the vertices of $G$ there exists $i \in \{1, ..., s\}$ such that there is a monochromatic $a_i$-clique of color $i$. The vertex…

Let $r,\ell\geq2$ be integers. Given $r$-graphs $G$ and $F_1,\dots,F_\ell$, we write $G\to(F_1,\dots,F_\ell)$ if every $\ell$-edge-coloring of $G$ yields a monochromatic copy of $F_i$ in the $i$th color for some $1\leq i\leq\ell$, otherwise…

The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains a copy of $F$ or its complement contains $H$. Burr in 1981 proved a pleasingly general result that for any graph $H$, provided $n$ is…

Let $f_r(n)$ represent the minimum number of complete $r$-partite $r$-graphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham-Pollak theorem states that $f_2(n)=n-1$. An upper bound of…

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed…

In [5] Graham and Rothschild consider a geometric Ramsey problem: finding the least n such that if all edges of the complete graph on the points {+1,-1}^n are 2-colored, there exist 4 coplanar points such that the 6 edges between them are…

We construct a new family of $K_s$-free graphs that leads to improved lower bounds for Ramsey numbers across a wide range of parameters. For any fixed $s \ge 4$, we show that the off-diagonal Ramsey numbers satisfy $r(s, k) \ge k^{s-2 +…

In this paper we prove a new upper bouhd on an edge Folkman number. In a previous paper we have proved that this bound is exact.

The Ramsey number $R(k)$ is the minimum $n \in \mathbb{N}$ such that every red-blue colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove that \[ R(k) \leqslant (4 -…

The induced Ramsey number $r_{\mathrm{ind}}(F)$ of a $k$-uniform hypergraph $F$ is the smallest natural number $n$ for which there exists a $k$-uniform hypergraph $G$ on $n$ vertices such that every two-coloring of the edges of $G$ contains…

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. We prove that $r_4(5,n)\ge 2^{2^{cn^{1/7}}}$, where $c>0$ is an absolute…

For a $k$-uniform hypergraph $F$ and a positive integer $n$, the Ramsey number $r(F,n)$ denotes the minimum $N$ such that every $N$-vertex $F$-free $k$-uniform hypergraph contains an independent set of $n$ vertices. A hypergraph is…

For graphs $F$ and $G$, let $F\to (G,G)$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Define Folkman number $f(G;p)$ to be the smallest order of a graph $F$ such that $F\to (G,G)$ and $\omega(F) \le p$. It is…

We study the following question raised by Erd\H{o}s and Hajnal in the early 90's. Over all $n$-vertex graphs $G$ what is the smallest possible value of $m$ for which any $m$ vertices of $G$ contain both a clique and an independent set of…

For each $r\ge 4$, we show that any graph $G$ with minimum degree at least $(1-1/100r)|G|$ has a fractional $K_r$-decomposition. This improves the best previous bounds on the minimum degree required to guarantee a fractional…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k,…

We present some new constructive upper bounds based on product graphs for generalized vertex Folkman numbers. They lead to new upper bounds for some special cases of generalized edge Folkman numbers, including $F_e(K_3,K_4-e; K_5) \leq 27$…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

We consider following geometric Ramsey problem: find the least dimension $n$ such that for any 2-coloring of edges of complete graph on the points $\{\pm 1\}^n$ there exists 4-vertex coplanar monochromatic clique. Problem was first analyzed…