{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:51:38Z","timestamp":1764557498034,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T00:00:00Z","timestamp":1561593600000},"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":"crossref","award":["11771247"],"award-info":[{"award-number":["11771247"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00373-019-02053-y","type":"journal-article","created":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T13:02:56Z","timestamp":1561640576000},"page":"1011-1021","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles and Matchings"],"prefix":"10.1007","volume":"35","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":[[2019,6,27]]},"reference":[{"issue":"1","key":"2053_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":"2053_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":"2053_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":"2053_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":"2053_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0095-8956(72)90020-2","volume":"12","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V.: On the Hamilton\u2019s ideal\u2019s. J. Combin. Theory Ser. B 12, 163\u2013168 (1972)","journal-title":"J. Combin. Theory Ser. B"},{"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)","key":"2053_CR6"},{"key":"2053_CR7","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":"2053_CR8","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.disc.2011.10.017","volume":"312","author":"R Haas","year":"2012","unstructured":"Haas, R., Young, M.: The anti-Ramsey number of perfect matching. Discrete Math. 312, 933\u2013937 (2012)","journal-title":"Discrete Math."},{"issue":"1","key":"2053_CR9","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":"2053_CR10","first-page":"57","volume":"218","author":"S Jahanbekam","year":"2013","unstructured":"Jahanbekam, S., West, D.B.: New lower bounds for matching numbers of general and bipartite graphs. Congr. Numer. 218, 57\u201359 (2013)","journal-title":"Congr. Numer."},{"issue":"2","key":"2053_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1006\/jctb.2001.2105","volume":"85","author":"T Jiang","year":"2002","unstructured":"Jiang, T.: Anti-Ramsey numbers of subdivided graphs. J. Combin. Theory Ser. B 85(2), 361\u2013366 (2002)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5\u20136","key":"2053_CR12","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1017\/S096354830300590X","volume":"12","author":"T Jiang","year":"2003","unstructured":"Jiang, T., West, D.B.: On the Erd\u0151s-Simonovits-S\u00f3s conjecture about the anti-Ramsey number of a cycle. Combin. Probab. Comput. 12(5\u20136), 585\u2013598 (2003). (Special issue on Ramsey theory)","journal-title":"Combin. Probab. Comput."},{"key":"2053_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.disc.2003.09.002","volume":"274","author":"T Jiang","year":"2004","unstructured":"Jiang, T., West, D.B.: Edge-colorings of complete graphs that avoid polychromatic trees. Discrete Math. 274, 137\u2013145 (2004)","journal-title":"Discrete Math."},{"key":"2053_CR14","doi-asserted-by":"crossref","first-page":"#R85","DOI":"10.37236\/174","volume":"16","author":"Z Jin","year":"2009","unstructured":"Jin, Z., Li, X.: Anti-Ramsey numbers for graphs with independent cycles. Electron. J. Combin. 16, #R85 (2009)","journal-title":"Electron. J. Combin."},{"key":"2053_CR15","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 Combin. 111, 75\u201384 (2013)","journal-title":"Ars Combin."},{"key":"2053_CR16","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., Xu, Z.: The rainbow number of matchings in regular bipartite graphs. Appl. Math. Lett. 22, 1525\u20131528 (2009)","journal-title":"Appl. Math. Lett."},{"key":"2053_CR17","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."},{"issue":"3","key":"2053_CR18","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":"2053_CR19","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."},{"issue":"1\u20132","key":"2053_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.disc.2003.11.057","volume":"286","author":"I Schiermeyer","year":"2004","unstructured":"Schiermeyer, I.: Rainbow numbers for matchings and complete graphs. Discrete Math. 286(1\u20132), 157\u2013162 (2004)","journal-title":"Discrete Math."},{"issue":"1","key":"2053_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02579162","volume":"4","author":"M Simonovits","year":"1984","unstructured":"Simonovits, M., S\u00f3s, V.T.: On restricted colourings of $K_n$. Combinatorica 4(1), 101\u2013110 (1984)","journal-title":"Combinatorica"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02053-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02053-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02053-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T23:25:02Z","timestamp":1593127502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02053-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,27]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2053"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02053-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,6,27]]},"assertion":[{"value":"6 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}