Related papers: Cycle-complete Ramsey numbers

The book graph $B_n^{(k)}$ consists of $n$ copies of $K_{k+1}$ joined along a common $K_k$. The Ramsey numbers of $B_n^{(k)}$ are known to have strong connections to the classical Ramsey numbers of cliques. Recently, the first author…

More than thirty years ago, Erd\H{o}s, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant $c_k$ such that $r(C_{2k+1}, G) \le c_k m$ for any graph $G$ with $m$ edges and no…

The Ramsey number $r(H)$ of a graph $H$ is the minimum $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ is then the minimum number of…

The online Ramsey game for graphs $G$ and $H$ is played on the infinite complete graph $K_\mathbb{N}$. Each round, Builder chooses an edge, and Painter colors it red or blue. The online Ramsey number $\tilde{r}(G,H)$ is the smallest integer…

An $r$-uniform linear cycle of length $\ell$, denoted by $C^r_{\ell}$, is an $r$-graph with $\ell$ edges $e_1,e_2,\dots,e_{\ell}$ where $e_i=\{v_{(r-1)(i-1)},v_{(r-1)(i-1)+1},\dots,v_{(r-1)i}\}$ (here $v_0=v_{(r-1)\ell}$). For $0<\delta<1$…

An $r$-uniform hypergraph ($r$-graph for short) is called linear if every pair of vertices belong to at most one edge. A linear $r$-graph is complete if every pair of vertices are in exactly one edge. The famous Brown-Erd\H{o}s-S\'os…

Let $k$ be a positive integer and let $G$ be a graph. The zero-sum Ramsey number $R(G,\mathbb{Z}_k)$ is the least integer $N$ (if it exists) such that for every edge-coloring $\chi \, : \, E(K_N) \, \rightarrow \, \mathbb{Z}_k$ one can find…

In 1955, Greenwood and Gleason showed that the Ramsey number R(3, 3, 3) = 17 by constructing an edge-chromatic graph on 16 vertices in three colors with no triangles. Their technique employed finite fields. This same result was obtained…

We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are minimal with this property. We show that every member in…

We prove that $s_r(K_k) = O(k^5 r^{5/2})$, where $s_r(K_k)$ is the Ramsey parameter introduced by Burr, Erd\H{o}s and Lov\'{a}sz in 1976, which is defined as the smallest minimum degree of a graph $G$ such that any $r$-colouring of the…

The Ramsey number r(H) of a graph H is the minimum positive integer N such that every two-coloring of the edges of the complete graph K_N on N vertices contains a monochromatic copy of H. A graph H is d-degenerate if every subgraph of H has…

The upper (mixed) domination Ramsey number $u(m, n)$($v(m,n)$) is the smallest integer $p$ such that every $2$-coloring of the edges of $K_p$ with color red and blue, $\Gamma(B) \geq m$ or $\Gamma(R) \geq n$ ($\beta(R) \geq n$); where $B$…

The induced size-Ramsey number $\hat{r}_\text{ind}^k(H)$ of a graph $H$ is the smallest number of edges a (host) graph $G$ can have such that for any $k$-coloring of its edges, there exists a monochromatic copy of $H$ which is an induced…

Given integers $2\le t \le k+1 \le n$, let $g_k(t,n)$ be the minimum $N$ such that every red/blue coloring of the $k$-subsets of $\{1, \ldots, N\}$ yields either a $(k+1)$-set containing $t$ red $k$-subsets, or an $n$-set with all of its…

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…

For a graph $H$ and an integer $k\ge1$, let $r(H;k)$ and $r_\ell(H;k)$ denote the $k$-color Ramsey number and list Ramsey number of $H$, respectively. Alon, Buci\'c, Kalvari, Kuperwasser and Szab\'o in 2021 initiated the systematic study of…

Let $F$, $G$ and $H$ be simple graphs. We say $F \rightarrow (G, H)$ if for every $2$-coloring of the edges of $F$ there exists a monochromatic $G$ or $H$ in $F$. The Ramsey number $r(G, H)$ is defined as $r(G, H) = min\{|V (F)|: F…

Given two graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the minimum integer $N$ such that any coloring of the edges of $K_N$ in red or blue yields a red $G$ or a blue $H$. Let $v(G)$ be the number of vertices of $G$ and $\chi(G)$ be the…

For ordered graphs $G$ and $H$, the ordered Ramsey number $r_<(G,H)$ is the smallest $n$ such that every red/blue edge coloring of the complete graph on vertices $\{1,\dots,n\}$ contains either a blue copy of $G$ or a red copy of $H$, where…

The $k$-colour bipartite Ramsey number of a bipartite graph $H$ is the least integer $n$ for which every $k$-edge-coloured complete bipartite graph $K_{n,n}$ contains a monochromatic copy of $H$. The study of bipartite Ramsey numbers was…