{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T06:30:14Z","timestamp":1768890614537,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"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":9939,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1016\/0012-365x(86)90171-8","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"243-256","source":"Crossref","is-referenced-by-count":35,"title":["On large matchings and cycles in sparse random graphs"],"prefix":"10.1016","volume":"59","author":[{"given":"A.M","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(86)90171-8_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","article-title":"The longest path in a random graph","volume":"1","author":"Ajtai","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(86)90171-8_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF02579230","article-title":"Long paths in sparse random graphs","volume":"2","author":"Bollob\u00e1s","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(86)90171-8_BIB3","series-title":"Graph Theory and Combinations, Proc. Cambridge Conf. in honour of P. Erd\u00f6s","first-page":"59","article-title":"Long cycles in sparse random graphs","author":"Bollob\u00e1s","year":"1984"},{"key":"10.1016\/0012-365X(86)90171-8_BIB4","unstructured":"B. Bollob\u00e1s and A.M. Frieze, On matchings and hamilton cycles in random graphs, Ann. Discrete Math. to appear."},{"key":"10.1016\/0012-365X(86)90171-8_BIB5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01894879","article-title":"On the existence of a factor of degree one of a connected random graph","volume":"17","author":"Erd\u00f6s","year":"1966","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0012-365X(86)90171-8_BIB6","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\/0012-365X(86)90171-8_BIB7","first-page":"335","article-title":"Long paths in random graphs","volume":"14","author":"Fernandez De La Vega","year":"1979","journal-title":"Studia Math. Hungar."},{"key":"10.1016\/0012-365X(86)90171-8_BIB8","series-title":"22nd IEEE Conf. Foundations of Computer Science","first-page":"364","article-title":"Maximum matchings in sparse random graphs","author":"Karp","year":"1981"},{"key":"10.1016\/0012-365X(86)90171-8_BIB9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","article-title":"Limit distribution for the existence of hamiltonian cycles in random graphs","volume":"43","author":"Koml\u00f3s","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(86)90171-8_BIB10","first-page":"760","article-title":"Solution of a problem of Erd\u00f6s and R\u00e9nyi on hamiltonian cycles in nonoriented graphs","volume":"17","author":"Korsunov","year":"1976","journal-title":"Soviet Math. Doklaidy"},{"key":"10.1016\/0012-365X(86)90171-8_BIB11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BFb0120903","article-title":"Clutter percolation and random graphs","volume":"3","author":"McDiarmid","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/0012-365X(86)90171-8_BIB12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamilton circuits in random graphs","volume":"14","author":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86901718?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86901718?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:53:07Z","timestamp":1553946787000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X86901718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["0012365X86901718"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(86)90171-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}