相关论文: Gallai-Ramsey numbers for graphs with chromatic nu…

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 $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \geqslant 2$,…

Given a positive integer $s$, a graph $G$ is $s$-Ramsey for a graph $H$, denoted $G\rightarrow (H)_s$, if every $s$-colouring of the edges of $G$ contains a monochromatic copy of $H$. The $s$-colour size-Ramsey number ${\hat{r}}_s(H)$ of a…

We define the $r\textit{-Kneser Ramsey number}$ $R^{\textrm{KG}}_{r}(s, t)$ as the minimum integer $n$ such that every red/blue edge-coloring of the Kneser graph $\textrm{KG}(n,r)$ contains a red $s$-clique or a blue $t$-clique. We obtain…

Given any graph $H$, a graph $G$ is said to be $q$-Ramsey for $H$ if every coloring of the edges of $G$ with $q$ colors yields a monochromatic subgraph isomorphic to $H$. Further, such a graph $G$ is said to be minimal $q$-Ramsey for $H$ if…

The Ramsey multiplicity constant of a graph $H$ is the minimum proportion of copies of $H$ in the complete graph which are monochromatic under an edge-coloring of $K_n$ as $n$ goes to infinity. Graphs for which this minimum is…

An ordered graph $\mathcal{G}$ is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of $\mathcal{G}$ is the smallest integer $N$ such that every 2-coloring of the edges of the complete ordered graph…

A Gallai coloring of a complete graph $K_n$ is an edge coloring without triangles colored with three different colors. A sequence $e_1\ge \dots \ge e_k$ of positive integers is an $(n,k)$-sequence if $\sum_{i=1}^k e_i=\binom{n}{2}$. An…

Let $G$, $H$ and $K$ represent three graphs without loops or parallel edges and $n$ represent an integer. Given any red blue coloring of the edges of $G$, we say that $K \rightarrow (G,H)$, if there exists red copy of $G$ in $K$ or a blue…

The set-colouring Ramsey number $R_{r,s}(k)$ is defined to be the minimum $n$ such that if each edge of the complete graph $K_n$ is assigned a set of $s$ colours from $\{1,\ldots,r\}$, then one of the colours contains a monochromatic clique…

An edge-colored graph is called \textit{rainbow graph} if all the colors on its edges are distinct. For a given positive integer $n$ and a family of graphs $\mathcal{G}$, the anti-Ramsey number $ar(n, \mathcal{G})$ is the smallest number of…

The multicolor Ramsey number $r_k(F)$ of a graph $F$ is the least integer $n$ such that in every coloring of the edges of $K_n$ by $k$ colors there is a monochromatic copy of $F$. In this short note we prove an upper bound on $r_k(F)$ for a…

A graph G is r-Ramsey for a graph H, denoted by G\rightarrow (H)_r, if every r-colouring of the edges of G contains a monochromatic copy of H. The graph G is called r-Ramsey-minimal for H if it is r-Ramsey for H but no proper subgraph of G…

For graphs $G^<$ and $H^<$ with linearly ordered vertex sets, the \ordered Ramsey number $r_<(G^<,H^<)$ is the smallest positive integer $N$ such that any red-blue coloring of the edges of the complete ordered graph $K^<_N$ on $N$ vertices…

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…

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$,…

Given a $k$-uniform hypergraph $G$ and a set of $k$-uniform hypergraphs $\mathcal{H}$, the generalized Ramsey number $f(G,\mathcal{H},q)$ is the minimum number of colors needed to edge-color $G$ so that every copy of every hypergraph $H\in…

The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erd\" os, Simonovits and S\' os. For given graphs $G$ and $H$ the \emph{anti-Ramsey number} $\textrm{ar}(G,H)$ is defined to be the maximum number $k$…

For given simple graphs $H_1,H_2,\dots,H_c$, the multicolor Ramsey number $R(H_1,H_2,\dots,H_c)$ is defined as the smallest positive integer $n$ such that for an arbitrary edge-decomposition $\{G_i\}^c_{i=1}$ of the complete graph $K_n$, at…

Suppose that $T$ is an acyclic $r$-uniform hypergraph, with $r\ge 2$. We define the ($t$-color) chromatic Ramsey number $\chi(T,t)$ as the smallest $m$ with the following property: if the edges of any $m$-chromatic $r$-uniform hypergraph…