{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:39:59Z","timestamp":1787319599273,"version":"build-2736575974"},"reference-count":28,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2023,6,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>An edge-colored graph [Formula: see text] is called rainbow if every edge of [Formula: see text] receives a different color. Given any host multigraph [Formula: see text], the anti-Ramsey number of [Formula: see text] edge-disjoint rainbow spanning trees in [Formula: see text], denoted by [Formula: see text], is defined as the maximum number of colors in an edge-coloring of [Formula: see text] containing no [Formula: see text] edge-disjoint rainbow spanning trees. For any vertex partition [Formula: see text], let [Formula: see text] be the set of noncrossing edges in [Formula: see text] with respect to [Formula: see text]. In this paper, we determine [Formula: see text] for all host multigraphs [Formula: see text]: [Formula: see text] if there exists a partition [Formula: see text] with [Formula: see text]; and [Formula: see text] otherwise. As a corollary, we determine [Formula: see text] for all values of [Formula: see text], improving a result of Jia, Lu, and Zhang.<\/jats:p>","DOI":"10.1137\/21m1428121","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T10:02:08Z","timestamp":1687255328000},"page":"1162-1172","source":"Crossref","is-referenced-by-count":0,"title":["Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs"],"prefix":"10.1137","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0155-2002","authenticated-orcid":true,"given":"Linyuan","family":"Lu","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of South Carolina, Columbia, SC 29208 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Meier","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of South Carolina, Columbia, SC 29208 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyu","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20204"},{"key":"ref2","first-page":"23","volume":"32","author":"Bialostocki A.","year":"2001","journal-title":"Bull. Inst. Combin. Appl."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1053"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/140992850"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2016.04.003"},{"key":"ref6","first-page":"335","volume":"11","author":"Edmonds J.","year":"1968","journal-title":"Amer. Math. Soc. Lectures Appl. Math."},{"key":"ref7","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"Edmonds J.","year":"1970"},{"key":"ref8","series-title":"Colloq. Math. Soc. Janos Bolyai 10","first-page":"633","volume-title":"Infinite and Finite Sets (Colloquia Keszthely 1973)","author":"Erd\u0151s P.","year":"1975"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.08.027"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0891-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2015.10.038"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/19M1244950"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.10.017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21888"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-020-02250-0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20380"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.09.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.06.034"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/19M1299876"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-005-0619-y"},{"key":"ref21","unstructured":"C. St. J. A. Nash-Williams , An application of matroids to graph theory, in Proceedings of Theory of Graphs: International Symposium, \nP. Rosenstiehl , ed. Gordon and Breach, New York, 1966, pp. 263\u2013265."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"ref23","series-title":"Algorithms Combin. 24","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency, Vol. B","author":"Schrijver A.","year":"2003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-006-0662-3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.221"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112130"},{"key":"ref27","unstructured":"L. Yuan , The Anti-Ramsey Number for Paths, arXiv:2102.00807, 2021."},{"key":"ref28","author":"Yuan L.","journal-title":"Anti-Ramsey Numbers of Graphs with Some Decomposition Family Sequences"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/21M1428121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:50:24Z","timestamp":1787316624000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/21M1428121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,20]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6,30]]}},"alternative-id":["10.1137\/21M1428121"],"URL":"https:\/\/doi.org\/10.1137\/21m1428121","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,20]]}}}