{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:39:16Z","timestamp":1772372356718,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1007\/bf02579230","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:17:13Z","timestamp":1174598233000},"page":"223-228","source":"Crossref","is-referenced-by-count":19,"title":["Long paths in sparse random graphs"],"prefix":"10.1007","volume":"2","author":[{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579230_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","volume":"1","author":"M. Ajtai","year":"1981","unstructured":"M. Ajtai, J. Koml\u00f3s andE. Szemer\u00e9di, The longest path in a random graph,Combinatorica 1 (1981) 1\u201312.","journal-title":"Combinatorica"},{"key":"BF02579230_CR2","volume-title":"Graph Theory \u2014 An Introductory Course","author":"B. Bollob\u00e1s","year":"1979","unstructured":"B. Bollob\u00e1s,Graph Theory \u2014 An Introductory Course, Graduate Texts in Mathematics, Springer-Verlag, New York, Heidelberg and Berlin, 1979."},{"key":"BF02579230_CR3","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"P. Erd\u0151s andA. R\u00e9nyi, On the evolution of random graphs,Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960) 17\u201361.","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"BF02579230_CR4","unstructured":"T. I. Fenner andA. M. Frieze, On the existence of hamiltonian cycles in a class of random graphs,to appear."},{"key":"BF02579230_CR5","unstructured":"W. F. de la V\u00e9ga, Long paths in random graphs,Combinatorica 3 (1983)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579230.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579230\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:44:59Z","timestamp":1558197899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["BF02579230"],"URL":"https:\/\/doi.org\/10.1007\/bf02579230","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}