{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T04:08:59Z","timestamp":1748923739884,"version":"3.41.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T00:00:00Z","timestamp":1745020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T00:00:00Z","timestamp":1745020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071274"],"award-info":[{"award-number":["12071274"]}],"id":[{"id":"10.13039\/501100001809","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":[[2025,6]]},"DOI":"10.1007\/s00373-025-02921-w","type":"journal-article","created":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T19:18:11Z","timestamp":1745090291000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Large Induced Distance Matchings in Certain Sparse Random Graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1895-178X","authenticated-orcid":false,"given":"Fang","family":"Tian","sequence":"first","affiliation":[]},{"given":"Yu-Qin","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Zi-Long","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,19]]},"reference":[{"key":"2921_CR1","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Ser. Discrete Math. Optim., John Wiley Sons Inc., Hoboken, (2008)"},{"issue":"1\u20133","key":"2921_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(92)90275-F","volume":"24","author":"K Cameron","year":"1989","unstructured":"Cameron, K.: Induced matchings. Discrete Appl. Math. 24(1\u20133), 97\u2013102 (1989)","journal-title":"Discrete Appl. Math."},{"key":"2921_CR3","first-page":"47","volume":"24","author":"L Clark","year":"2001","unstructured":"Clark, L.: The strong matching number of a random graph. Australas. J. Combin. 24, 47\u201358 (2001)","journal-title":"Australas. J. Combin."},{"issue":"1","key":"2921_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/20M1330609","volume":"35","author":"O Cooley","year":"2021","unstructured":"Cooley, O., Dragani\u0107, N., Kang, M., Sudakov, B.: Large induced matchings in random graphs. SIAM J. Discrete Math. 35(1), 267\u2013280 (2021)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"2921_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disc.2003.09.009","volume":"281","author":"A Czygrinow","year":"2004","unstructured":"Czygrinow, A., Nagle, B.: Bounding the strong chromatic index of dense random graphs. Discrete Math. 281(1), 129\u2013136 (2004)","journal-title":"Discrete Math."},{"key":"2921_CR6","first-page":"97","volume":"10","author":"A El Maftouhi","year":"1994","unstructured":"El Maftouhi, A., Gordones, L.M.: The maximum order of a strong matching in a random graph. Australas. J. Combin. 10, 97\u2013104 (1994)","journal-title":"Australas. J. Combin."},{"issue":"3","key":"2921_CR7","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1137\/S0895480104445757","volume":"19","author":"A Frieze","year":"2005","unstructured":"Frieze, A., Krivelevich, M., Sudakov, B.: The strong chromatic index of random graphs. SIAM J. Discrete Math. 19(3), 719\u2013727 (2005)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"2921_CR8","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/130944424","volume":"28","author":"F Joos","year":"2014","unstructured":"Joos, F., Rautenbach, D., Sasse, T.: Induced matchings in subcubic graphs. SIAM J. Discrete Math. 28(1), 468\u2013473 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"2921_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1017\/S0963548313000473","volume":"23","author":"T Kaiser","year":"2014","unstructured":"Kaiser, T., Kang, R.J.: The distance-$$t$$ chromatic index of graphs. Comb. Probab. Comput. 23(1), 90\u2013101 (2014)","journal-title":"Comb. Probab. Comput."},{"key":"2921_CR10","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1016\/j.dam.2012.07.001","volume":"160","author":"RJ Kang","year":"2012","unstructured":"Kang, R.J., Manggala, P.: Distance edge-colorings and matchings. Discrete Appl. Math. 160, 2435\u20132439 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"2921_CR11","first-page":"175","volume":"47","author":"F Tian","year":"2018","unstructured":"Tian, F.: On distance matching number in a class of sparse random graphs. Adv. Math. (China) 47(2), 175\u2013181 (2018)","journal-title":"Adv. Math. (China)"},{"issue":"10","key":"2921_CR12","doi-asserted-by":"publisher","first-page":"2457","DOI":"10.1016\/j.disc.2016.04.016","volume":"339","author":"GH Wang","year":"2016","unstructured":"Wang, G.H., Yan, G.Y., Yu, X.W.: Existence of rainbow matchings in strongly edge-colored graphs. Discrete Math. 339(10), 2457\u20132460 (2016)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02921-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02921-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02921-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T20:02:20Z","timestamp":1748894540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02921-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,19]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2921"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02921-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,4,19]]},"assertion":[{"value":"14 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"61"}}