{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:52:32Z","timestamp":1764557552294,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Given a graph $G$, a hypergraph $\\mathcal{H}$ is a Berge copy of $F$ if $V(G)\\subset V(\\mathcal{H})$ and there is a bijection $f:E(G)\\rightarrow E(\\mathcal{H})$ such that for any edge $e$ of $G$ we have $e\\subset f(e)$. We study Ramsey problems for Berge copies of graphs, i.e. the smallest number of vertices of a complete $r$-uniform hypergraph, such that if we color the hyperedges with $c$ colors, there is a monochromatic Berge copy of $G$.\r\nWe obtain a couple results regarding these problems. In particular, we determine for which $r$ and $c$ the Ramsey number can be super-linear. We also show a new way to obtain lower bounds, and improve the general lower bounds by a large margin. In the specific case $G=K_n$ and $r=2c-1$, we obtain an upper bound that is sharp besides a constant term, improving earlier results.<\/jats:p>","DOI":"10.37236\/8775","type":"journal-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T02:20:02Z","timestamp":1590718802000},"source":"Crossref","is-referenced-by-count":2,"title":["On Berge-Ramsey Problems"],"prefix":"10.37236","volume":"27","author":[{"given":"D\u00e1niel","family":"Gerbner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,5,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i2p39\/8096","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i2p39\/8096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T02:20:02Z","timestamp":1590718802000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i2p39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,29]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,4,3]]}},"URL":"https:\/\/doi.org\/10.37236\/8775","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,5,29]]},"article-number":"P2.39"}}