On Ramsey numbers of 3-uniform Berge cycles

Leila Maherani, Maryam Shahsiah

For an arbitrary graph $G$, a hypergraph $\mathcal{H}$ is called Berge-$G$ if there is a bijection $\Phi :E(G)⟶E(\mathcal{H})$ such that for each $e\in E(G)$, we have $…