{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T01:55:16Z","timestamp":1789782916800,"version":"4.0.1"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1600811"],"award-info":[{"award-number":["DMS-1600811"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>For any $r\\geq 2$ and $k\\geq 3$, the $r$-color size-Ramsey number $\\hat R(\\mathcal{G},r)$ of a $k$-uniform hypergraph $\\mathcal{G}$ is the smallest integer $m$ such that there exists a $k$-uniform hypergraph $\\mathcal{H}$ on $m$ edges such that any coloring of the edges of $\\mathcal{H}$ with $r$ colors yields a monochromatic copy of $\\mathcal{G}$. Let $\\mathcal{P}_{n,k-1}^{(k)}$ denote the $k$-uniform tight path on $n$ vertices. Dudek et al. [ J. Graph Theory, 86 (2017), pp. 104--121] showed that the size-Ramsey number of tight paths $\\hat R(\\mathcal{P}_{n,k-1}^{(k)}, 2) = O(n^{k-1-\\alpha} (\\log n)^{1+\\alpha})$ where $\\alpha = (k-2)\/(\\binom{k-1}{2}+1)$. In this paper, we improve their bound by showing that $\\hat R(\\mathcal{P}_{n,k-1}^{(k)}, r) = O(r^k (n\\log n)^{k\/2})$ for all $k\\geq 3$ and $r\\geq 2$.<\/jats:p>","DOI":"10.1137\/18m1170546","type":"journal-article","created":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T12:47:34Z","timestamp":1535546854000},"page":"2172-2179","source":"Crossref","is-referenced-by-count":5,"title":["On the Size-Ramsey Number of Tight Paths"],"prefix":"10.1137","volume":"32","author":[{"given":"Linyuan","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,8,29]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(88)90189-6"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070115"},{"key":"atypb3","first-page":"5","volume":"13","author":"Bielak H.","year":"1993","journal-title":"Discuss. Math."},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176994428"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22115"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1017\/S096354831400056X"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/16M1069717"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579174"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018930"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070014"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000279"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1170546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:59:23Z","timestamp":1787320763000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1170546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/18M1170546"],"URL":"https:\/\/doi.org\/10.1137\/18m1170546","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}