{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:52:36Z","timestamp":1764557556988,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T00:00:00Z","timestamp":1605139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T00:00:00Z","timestamp":1605139200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901048","11771247"],"award-info":[{"award-number":["11901048","11771247"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2019M660562"],"award-info":[{"award-number":["2019M660562"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00373-020-02250-0","type":"journal-article","created":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T16:10:35Z","timestamp":1605197435000},"page":"409-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees"],"prefix":"10.1007","volume":"37","author":[{"given":"Yuxing","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,12]]},"reference":[{"issue":"1","key":"2250_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/jgt.3190070112","volume":"7","author":"N Alon","year":"1983","unstructured":"Alon, N.: On a conjecture of Erd\u0151s, Simonovits, and S\u00f3s concerning anti-Ramsey theorems. J. Graph Theory 7(1), 91\u201394 (1983)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2250_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/jgt.20012","volume":"47","author":"M Axenovich","year":"2004","unstructured":"Axenovich, M., Jiang, T., K\u00fcndgen, A.: Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47(1), 9\u201328 (2004)","journal-title":"J. Graph Theory"},{"key":"2250_CR3","first-page":"23","volume":"32","author":"A Bialostocki","year":"2001","unstructured":"Bialostocki, A., Voxman, W.: On the anti-Ramsey numbers for spanning trees. Bull. Inst. Combin. Appl. 32, 23\u201326 (2001)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2250_CR4","doi-asserted-by":"publisher","first-page":"3370","DOI":"10.1016\/j.disc.2008.10.002","volume":"309","author":"H Chen","year":"2009","unstructured":"Chen, H., Li, X., Tu, J.: Complete solution for the rainbow numbers of matchings. Discrete Math. 309, 3370\u20133380 (2009)","journal-title":"Discrete Math."},{"key":"2250_CR5","first-page":"633","volume":"10","author":"P Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., Simonovits, M., S\u00f3s, V.: Anti-Ramsey theorems. In: Infinite and finite sets (Colloq. Keszthely 1973), Colloq. Math. Soc. J\u00e1nos Bolyai 10, 633\u2013643 (1975)","journal-title":"Math. Soc. J\u00e1nos Bolyai"},{"key":"2250_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0891-3","volume":"26","author":"S Fujita","year":"2010","unstructured":"Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of Ramsey theory: a survey. Graphs Combin. 26, 1\u201330 (2010)","journal-title":"Graphs Combin."},{"key":"2250_CR7","doi-asserted-by":"crossref","unstructured":"R. Haas and M. Young, The anti-Ramsey number of perfect matching. Discrete Math 312 (2012), 933C937","DOI":"10.1016\/j.disc.2011.10.017"},{"issue":"1","key":"2250_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/jgt.21888","volume":"82","author":"S Jahanbekam","year":"2016","unstructured":"Jahanbekam, S., West, D.B.: Anti-Ramsey problems for $$t$$ edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees. J. Graph Theory 82(1), 75\u201389 (2016)","journal-title":"J. Graph Theory"},{"key":"2250_CR9","first-page":"57","volume":"218","author":"S Jahanbekam","year":"2013","unstructured":"Jahanbekam, S., West, D.B.: New lower bounds on matching numbers of general and bipartite graphs. Congressus Numer 218, 57\u201359 (2013)","journal-title":"Congressus Numer"},{"key":"2250_CR10","doi-asserted-by":"crossref","unstructured":"Y. Jia, M. Lu and Y. Zhang, Anti-Ramsey problems in complete bipartite graphs for $$t$$ edge-disjoint rainbow spanning subgraphs: Cycles and Matchings, report 2018","DOI":"10.1007\/s00373-019-02053-y"},{"key":"2250_CR11","doi-asserted-by":"crossref","unstructured":"T. Jiang, D. B. West, On the Erd\u0151s-Simonovits-S\u00f3s conjecture about the anti-Ramsey number of a cycle, Combin. Probab. Comput. 12(5-6):585-598 (2003) (Special issue on Ramsey theory)","DOI":"10.1017\/S096354830300590X"},{"key":"2250_CR12","doi-asserted-by":"crossref","unstructured":"Z. Jin, X. Li, Anti-Ramsey numbers for graphs with independent cycles, Electron. J. Combin. 16 (2009), #R85","DOI":"10.37236\/174"},{"key":"2250_CR13","first-page":"75","volume":"111","author":"Z Jin","year":"2013","unstructured":"Jin, Z., Li, L.: Edge-colorings of complete bipartite graphs without large rainbow trees. Ars Comb. 111, 75\u201384 (2013)","journal-title":"Ars Comb."},{"key":"2250_CR14","doi-asserted-by":"publisher","first-page":"2575","DOI":"10.1016\/j.disc.2008.05.011","volume":"309","author":"X Li","year":"2009","unstructured":"Li, X., Tu, J., Jin, Z.: Bipartite rainbow numbers of matchings. Discrete Math. 309, 2575\u20132578 (2009)","journal-title":"Discrete Math."},{"key":"2250_CR15","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1016\/j.aml.2009.03.019","volume":"22","author":"X Li","year":"2009","unstructured":"Li, X., X, Z.: The rainbow number of matchings in regular bipartite graphs. Appl. Math. Lett 22, 1525\u20131528 (2009)","journal-title":"Appl. Math. Lett"},{"issue":"3","key":"2250_CR16","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s004930200023","volume":"22","author":"JJ Montellano-Ballesteros","year":"2002","unstructured":"Montellano-Ballesteros, J.J., Neumann-Lara, V.: An anti-Ramsey theorem. Combinatorica 22(3), 445\u2013449 (2002)","journal-title":"Combinatorica"},{"issue":"3","key":"2250_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00373-005-0619-y","volume":"21","author":"JJ Montellano-Ballesteros","year":"2005","unstructured":"Montellano-Ballesteros, J.J., Neumann-Lara, V.: An anti-Ramsey theorem on cycles. Graphs Combin. 21(3), 343\u2013354 (2005)","journal-title":"Graphs Combin."},{"key":"2250_CR18","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"CStJA Nash-Williams","year":"1961","unstructured":"Nash-Williams, CStJA: Edge disjoint spanning trees of finite graphs. J. Lond. Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02250-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02250-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02250-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T14:10:40Z","timestamp":1614262240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02250-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,12]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["2250"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02250-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,11,12]]},"assertion":[{"value":"2 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}