{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:41Z","timestamp":1740107141814,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T00:00:00Z","timestamp":1499817600000},"content-version":"unspecified","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":["NSFC 11171114"],"award-info":[{"award-number":["NSFC 11171114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["STCSM 13dz2260400"],"award-info":[{"award-number":["STCSM 13dz2260400"]}],"id":[{"id":"10.13039\/501100003399","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":[[2017,9]]},"DOI":"10.1007\/s00373-017-1829-9","type":"journal-article","created":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T13:49:10Z","timestamp":1499867350000},"page":"1147-1154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds on the Number of Monochromatic Matchings in \n                $$K_{2s+t-1}$$\n                \n                    \n                                    \n                        \n                            K\n                            \n                                2\n                                s\n                                +\n                                t\n                                -\n                                1"],"prefix":"10.1007","volume":"33","author":[{"given":"Weihua","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fugang","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ni","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,12]]},"reference":[{"key":"1829_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00373-011-1051-0","volume":"28","author":"N Cao","year":"2012","unstructured":"Cao, N., Ren, H.: Exponentially many monochromatic \n                        $$n$$\n                        \n                            \n                                            \n                                n\n                            \n                        \n                    -matchings in \n                        $$K_{3n-1}$$\n                        \n                            \n                                            \n                                \n                                    K\n                                    \n                                        3\n                                        n\n                                        -\n                                        1\n                                    \n                                \n                            \n                        \n                    . Graphs Combin. 28, 309\u2013314 (2012)","journal-title":"Graphs Combin."},{"key":"1829_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ins.2014.03.133","volume":"278","author":"S Cao","year":"2014","unstructured":"Cao, S., Dehmer, M., Shi, Y.: Extremality of degree-based graph entropies. Inf. Sci. 278, 22\u201333 (2014)","journal-title":"Inf. Sci."},{"key":"1829_CR3","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1017\/S1446788700029554","volume":"19","author":"EJ Cockayne","year":"1975","unstructured":"Cockayne, E.J., Lorimer, P.J.: The Ramsey number of strips. J. Aust. Math. Soc. 19, 252\u2013256 (1975)","journal-title":"J. Aust. Math. Soc."},{"key":"1829_CR4","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0095-8956(91)90007-7","volume":"51","author":"P Erd\u00f6s","year":"1991","unstructured":"Erd\u00f6s, P., Gy\u00e1rf\u00e1s, A., Pyber, L.: Vertex coverings by monochromatic cycles and trees. J. Combin. Theory Ser. B 51, 90\u201395 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1829_CR5","first-page":"167","volume":"10","author":"G Gerencs\u00e9r","year":"1967","unstructured":"Gerencs\u00e9r, G., Gy\u00e1rf\u00e1s, A.: On Ramsey-type problems. Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sect. Math 10, 167\u2013170 (1967)","journal-title":"Ann. Univ. Sci. Budapest E\u00f6tv\u00f6s Sect. Math"},{"issue":"2","key":"1829_CR6","first-page":"697","volume":"70","author":"S Ji","year":"2013","unstructured":"Ji, S., Li, X., Shi, Y.: The extremal matching energy of bicyclic graphs. MATCH Commun. Math. Comput. Chem. 70(2), 697\u2013706 (2013)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"1829_CR7","first-page":"885","volume":"70","author":"V Kraus","year":"2013","unstructured":"Kraus, V., Dehmer, M., Schutte, M.: On sphere-regular graphs and the extremality of information-theoretic network measures. MATCH Commun. Math. Comput. Chem. 70, 885\u2013900 (2013)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"1","key":"1829_CR8","first-page":"85","volume":"70","author":"X Li","year":"2013","unstructured":"Li, X., Li, Y., Shi, Y., Gutman, I.: Note on the HOMO-LUMO index of graphs. MATCH Commun. Math. Comput. Chem. 70(1), 85\u201396 (2013)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"1","key":"1829_CR9","first-page":"183","volume":"72","author":"X Li","year":"2014","unstructured":"Li, X., Shi, Y., Wei, M., Li, J.: On a conjecture about tricyclic graphs with maximal energy. MATCH Commun. Math. Comput. Chem. 72(1), 183\u2013214 (2014)","journal-title":"MATCH Commun. Math. Comput. Chem."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1829-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1829-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1829-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,19]],"date-time":"2017-10-19T15:34:48Z","timestamp":1508427288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1829-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,12]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1829"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1829-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2017,7,12]]}}}