Paper detail

On Ramsey numbers of 3-uniform Berge cycles

For an arbitrary graph $G$, a hypergraph $\mathcal{H}$ is called Berge-$G$ if there is a bijection $Φ:E(G)\longrightarrow E( \mathcal{H})$ such that for each $e\in E(G)$, we have $e\subseteq Φ(e)$. We denote by $\mathcal{B}^rG$, the family of $r$-uniform Berge-$G$ hypergraphs. For families $\mathcal{H}_1, \mathcal{H}_2,\ldots, \mathcal{H}_t$ of $r$-uniform hypergraphs, the Ramsey number $R(\mathcal{H}_1, \mathcal{H}_2,\ldots, \mathcal{H}_t)$ is the smallest integer $n$ such that in every $t$-hyperedge coloring of $\mathcal{K}_{n}^r$ there is a monochromatic copy of a hypergraph in $\mathcal{H}_i$ of color $i$, for some $1\leq i\leq t$. Recently, the Ramsey problems of Berge hypergraphs have been studied by many researchers. In this paper, we focus on Ramsey number involving $3$-uniform Berge cycles and we prove that for $n \geq 4$, $ R(\mathcal{B}^3C_n,\mathcal{B}^3C_n,\mathcal{B}^3C_3)=n+1.$ Moreover, for $m \geq n\geq 6$ and $m\geq 11$, we show that $R(\mathcal{B}^3K_m,\mathcal{B}^3C_n)= m+\lfloor \frac{n-1}{2}\rfloor -1.$ This is the first result of Ramsey number for two different families of Berge hypergraphs.