{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T00:30:13Z","timestamp":1787358613379,"version":"build-2736575974"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","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":[[2020,1]]},"abstract":"<jats:p>An edge-colored graph $G$ is called rainbow if every edge of $G$ receives a different color. The anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees, denoted by $r(n,t)$, is defined as the maximum number of colors in an edge-coloring of $K_n$ containing no $t$ edge-disjoint rainbow spanning trees. Jahanbekam and West [ J. Graph Theory, 82 (2016), pp. 75--89] conjectured that for any fixed $t$, $r(n,t)=(\\begin{smallmatrix}{n-2}\\\\{2}\\end{smallmatrix})+t$ whenever $n\\geq 2t+2 \\geq 6$. In this paper, we prove this conjecture. We also determine $r(n,t)$ when $n = 2t+1$. Together with previous results, this gives the anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees for all values of $n$ and $t$.<\/jats:p>","DOI":"10.1137\/19m1299876","type":"journal-article","created":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T13:00:33Z","timestamp":1605186033000},"page":"2346-2362","source":"Crossref","is-referenced-by-count":2,"title":["Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees"],"prefix":"10.1137","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0155-2002","authenticated-orcid":true,"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":[[2020,11,12]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20204"},{"key":"atypb2","first-page":"23","volume":"32","author":"Bialostocki A.","year":"2001","journal-title":"Bull. Inst. Combin. Appl."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1053"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/140992850"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2016.04.003"},{"key":"atypb6","first-page":"335","volume":"11","author":"Edmonds J.","year":"1968","journal-title":"Amer. Math Soc. Lectures in Appl. Math."},{"key":"atypb7","first-page":"69","author":"Edmonds J.","year":"1970","journal-title":"New York"},{"key":"atypb8","first-page":"633","volume":"10","author":"Erd\u00f6s P.","year":"1975","journal-title":"Colloq Math Soc Janos Bolyai"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0891-3"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.10.017"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21888"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.09.002"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-005-0619-y"},{"key":"atypb14","first-page":"263","author":"St C.","year":"1967","journal-title":"Paris"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"atypb16","unstructured":"A. Schrijver,\n                      Combinatorial optimization. Polyhedra and efficiency. Vol. B\n                      , Volume 24 of Algorithms and Combinatorics, Springer-Verlag, Berlin, 2003."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-006-0662-3"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.221"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/19M1299876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:42:46Z","timestamp":1787319766000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/19M1299876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1137\/19M1299876"],"URL":"https:\/\/doi.org\/10.1137\/19m1299876","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}