{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:05:30Z","timestamp":1758823530731},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9969,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1016\/0095-8956(86)90077-8","type":"journal-article","created":{"date-parts":[[2004,12,21]],"date-time":"2004-12-21T20:35:48Z","timestamp":1103661348000},"page":"196-212","source":"Crossref","is-referenced-by-count":22,"title":["Maximum matchings in a class of random graphs"],"prefix":"10.1016","volume":"40","author":[{"given":"A.M.","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(86)90077-8_BIB1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0095-8956(86)90077-8_BIB2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02579431","article-title":"On the connectivity of random m-orientable graphs and digraphs","volume":"2","author":"Fenner","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(86)90077-8_BIB3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(83)90046-8","article-title":"On the existence of hamiltonian cycles in a class of random graphs","volume":"45","author":"Fenner","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(86)90077-8_BIB4","first-page":"133","article-title":"\u00dcber extreme Punkt- und Kantenmengen","volume":"2","author":"Gallai","year":"1959","journal-title":"Ann. Univ. Sci. Budapest, E\u00f6tv\u00f6s Sect. Math"},{"key":"10.1016\/0095-8956(86)90077-8_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(86)90076-6","article-title":"An exact threshold theorem for random graphs and the node-packing problem","volume":"40","author":"Grimmett","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(86)90077-8_BIB6","unstructured":"G. R. Grimmett and W. R. Pulleyblank, Random near-regular graphs and the node packing problem, to appear."},{"key":"10.1016\/0095-8956(86)90077-8_BIB7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(82)90023-1","article-title":"One-factor in random graphs based of vertex choice","volume":"41","author":"Shamir","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(86)90077-8_BIB8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorisation of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(86)90077-8_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","article-title":"Matchings in random regular bipartite graphs","volume":"31","author":"Walkup","year":"1980","journal-title":"Discrete Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900778?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900778?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T15:52:26Z","timestamp":1548863546000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895686900778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0095895686900778"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(86)90077-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}