{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:10:04Z","timestamp":1758823804379,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of $3$-uniform loose paths when one of the paths is significantly larger than the other: \u00a0for every $n\\geq \\Big\\lfloor\\frac{5m}{4}\\Big\\rfloor$, we show that $$R(\\mathcal{P}^3_n,\\mathcal{P}^3_m)=2n+\\Big\\lfloor\\frac{m+1}{2}\\Big\\rfloor.$$<\/jats:p>","DOI":"10.37236\/2725","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:00:26Z","timestamp":1578711626000},"source":"Crossref","is-referenced-by-count":14,"title":["The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs"],"prefix":"10.37236","volume":"20","author":[{"given":"Leila","family":"Maherani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gholam Reza","family":"Omidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghaffar","family":"Raeisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Shahsiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2013,1,21]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p12\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p12\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T22:20:10Z","timestamp":1579299610000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i1p12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/2725","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,1,21]]},"article-number":"P12"}}