{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T17:07:12Z","timestamp":1782061632783,"version":"3.54.5"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $R(G)$ be the $2$-colour Ramsey number of a graph $G$.In this note, we prove that for any non-decreasing function $n \\leq f(n) \\leq R(K_n)$, there exists a sequence of connected graphs $(G_n)_{n\\in\\mathbb N}$, with $|V(G_n)| = n$ for all $n \\geq 1$, such that $R(G_n) = \\Theta(f(n))$. In contrast, we also show that an analogous statement does not hold for hypergraphs of uniformity at least $5$.We also use our techniques to answer in the affirmative a question posed by DeBiasio about the existence of sequences of graphs, but whose $2$-colour Ramsey number is linear whereas their $3$-colour Ramsey number has superlinear growth.<\/jats:p>","DOI":"10.37236\/11652","type":"journal-article","created":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T19:30:58Z","timestamp":1692905458000},"source":"Crossref","is-referenced-by-count":1,"title":["Ramsey Numbers with Prescribed Rate of Growth"],"prefix":"10.37236","volume":"30","author":[{"given":"Mat\u00edas","family":"Pavez-Sign\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sim\u00f3n","family":"Piga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicol\u00e1s","family":"Sanhueza-Matamala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2023,8,25]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v30i3p24\/8871","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v30i3p24\/8871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T19:30:58Z","timestamp":1692905458000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v30i3p24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,25]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,7,14]]}},"URL":"https:\/\/doi.org\/10.37236\/11652","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,25]]},"article-number":"P3.24"}}