{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:10:54Z","timestamp":1787508654421,"version":"build-2736575974"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>For a graph $G=(V,E)$, a hypergraph $\\mathcal{H}$ is called a Berge-$G$, denoted by $BG$, if there exists an injection $f: E(G) \\to E(\\mathcal{H})$ such that for every $e \\in E(G)$, $e \\subseteq f(e)$. Let the Ramsey number $R^r(BG,BG)$ be the smallest integer $n$ such that for any $2$-edge-coloring of a complete $r$-uniform hypergraph on $n$ vertices, there is a monochromatic Berge-$G$ subhypergraph. In this paper, we show that the 2-color Ramsey number of Berge cliques is linear. In particular, we show that $R^3(BK_s, BK_t) = s+t-3$ for $s,t \\geq 4$ and $\\max(s,t) \\geq 5$ where $BK_n$ is a Berge-$K_n$ hypergraph. For higher uniformity, we show that $R^4(BK_t, BK_t) = t+1$ for $t\\geq 6$ and $R^k(BK_t, BK_t)=t$ for $k \\geq 5$ and $t$ sufficiently large. We also investigate the Ramsey number of trace hypergraphs, suspension hypergraphs and expansion hypergraphs.<\/jats:p>","DOI":"10.37236\/8892","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T01:01:39Z","timestamp":1578618099000},"source":"Crossref","is-referenced-by-count":6,"title":["Ramsey Numbers of Berge-Hypergraphs and Related Structures"],"prefix":"10.37236","volume":"26","author":[{"given":"Nika","family":"Salia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Casey","family":"Tompkins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oscar","family":"Zamora","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2019,12,6]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i4p40\/7965","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i4p40\/7965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:00:59Z","timestamp":1579215659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i4p40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,6]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,10,11]]}},"URL":"https:\/\/doi.org\/10.37236\/8892","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,6]]},"article-number":"P4.40"}}