{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T03:21:04Z","timestamp":1787368864332,"version":"build-2736575974"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200020-162884"],"award-info":[{"award-number":["200020-162884"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021-175977"],"award-info":[{"award-number":["200021-175977"]}],"id":[{"id":"10.13039\/501100001711","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>The $t$-colored rainbow saturation number ${rsat}_t(n,F)$ is the minimum size of a $t$-edge-colored graph on $n$ vertices that contains no rainbow copy of $F$, but the addition of any missing edge in any color creates such a rainbow copy. Barrus et al. conjectured that ${rsat}_t(n,K_s) = \\Theta(n\\log n)$ for every $s\\ge 3$ and $t\\ge \\binom{s}{2}$. In this short note we prove the conjecture in a strong sense, asymptotically determining the rainbow saturation number for triangles. Our lower bound is probabilistic in spirit, and the upper bound is based on the Shannon capacity of a certain family of cliques.<\/jats:p>","DOI":"10.1137\/17m1155429","type":"journal-article","created":{"date-parts":[[2018,6,5]],"date-time":"2018-06-05T13:19:12Z","timestamp":1528204752000},"page":"1261-1264","source":"Crossref","is-referenced-by-count":7,"title":["Rainbow Saturation and Graph Capacities"],"prefix":"10.1137","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3975-0787","authenticated-orcid":true,"given":"D\u00e1niel","family":"Kor\u00e1ndi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,6,5]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22132"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.04.007"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"I. Csisza\u0301r and J. Ko\u0308rner,\n                      Information Theory: Coding Theorems for Discrete Memoryless Systems\n                      , 2nd ed., Cambridge University Press, 2011.","DOI":"10.1017\/CBO9780511921889"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.2307\/2311408"},{"key":"atypb5","unstructured":"M. Ferrara, D. Johnston, S. Loeb, F. Pfender, A. Schulte, H. C. Smith, E. Sullivan, M. Tait, and C. Tompkins,\n                      On Edge-Colored Saturation Problems\n                      , preprint,https:\/\/arxiv.org\/abs\/1712.00163, 2017."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s003730050022"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01195325"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(94)90108-2"},{"key":"atypb9","unstructured":"A. Gira\u0342o, D. Lewis, and K. Popielarz,\n                      Rainbow Saturation of Graphs\n                      , preprint,https:\/\/arxiv.org\/abs\/1710.08025, 2017."},{"key":"atypb10","first-page":"23","volume":"2","author":"Katona G.","year":"1967","journal-title":"Stud. Sci. Math. Hungar."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20703"},{"key":"atypb12","first-page":"179","author":"Kostochka A. V.","year":"1999","journal-title":"AMS"},{"key":"atypb13","first-page":"293","author":"Simonyi G.","year":"2001","journal-title":"John Wiley & Sons"},{"key":"atypb14","first-page":"163","volume":"24","author":"Zykov A. A.","year":"1949","journal-title":"S.)"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1155429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:06:01Z","timestamp":1787317561000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1155429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1155429"],"URL":"https:\/\/doi.org\/10.1137\/17m1155429","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}