{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:02:11Z","timestamp":1709830931289},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"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":[[1983,3]]},"DOI":"10.1007\/bf02579348","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T18:17:58Z","timestamp":1174587478000},"page":"123-131","source":"Crossref","is-referenced-by-count":19,"title":["How many random edges make a graph hamiltonian?"],"prefix":"10.1007","volume":"3","author":[{"given":"Eli","family":"Shamir","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579348_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":"BF02579348_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"D. Angluin andL. G. Valiant, Fast probabilistic algorithms for Hamiltonian circuits and matching,J. Comp. System Sci. 18 (1979), 155\u2013193.","journal-title":"J. Comp. System Sci."},{"key":"BF02579348_CR3","volume-title":"Graph Theory, an Introductory Course","author":"B. Bollob\u00e1s","year":"1979","unstructured":"B. Bollob\u00e1s,Graph Theory, an Introductory Course, Springer, North-Holland, (1979)."},{"key":"BF02579348_CR4","volume-title":"The Art of Counting\u2014Selected Writing","author":"P. Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s,The Art of Counting\u2014Selected Writing (J. Spencer, Ed.), The M.I.T. Press, Cambridge (1973)."},{"key":"BF02579348_CR5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","volume":"12","author":"P. Erd\u0151s","year":"1961","unstructured":"P. Erd\u0151s andA. R\u00e9nyi, On the strength of connectedness in random graphs,Acta Math. Acad. Sci. Hung. 12 (1961) 261\u2013267.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"BF02579348_CR6","unstructured":"P. Erd\u0151s, R. M. Karp andJ. Spencer, Personal communication."},{"key":"BF02579348_CR7","unstructured":"W. Feller,An Introduction to Probability Theory and its Applications I., Wiley N. Y. (1957)."},{"key":"BF02579348_CR8","unstructured":"R. M. Karp, The Probabilistic analysis of some combinatorical search algorithms,Algorithms and Complexity (J. F. Traub, Ed.) Academic Press N. Y. (1976)."},{"key":"BF02579348_CR9","first-page":"760","volume":"17","author":"A. D. Kor\u0161unov","year":"1976","unstructured":"A. D. Kor\u0161unov, Solution of a Problem of Erd\u0151s and R\u00e9nyi on Hamiltonian cycles,Soviet Math. Dokl. 17 (1976), 760\u2013764.","journal-title":"Soviet Math. Dokl."},{"key":"BF02579348_CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"L. P\u00f3sa","year":"1976","unstructured":"L. P\u00f3sa, Hamiltonian circuits in random graphs.Discrete Math. 14 (1976), 359\u2013364.","journal-title":"Discrete Math."},{"key":"BF02579348_CR11","doi-asserted-by":"crossref","unstructured":"J. H. Reif andP. G. Spirakis, Random matroids, 12annual ACM Symp. on Theory of Computing (1980), 385\u2013397.","DOI":"10.1145\/800141.804688"},{"issue":"4","key":"BF02579348_CR12","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/BF02761675","volume":"39","author":"E. Shamir","year":"1981","unstructured":"E. Shamir andE. Upfal, On factors in random graphs,Israel J. of Math. 39, 4 (1981), 296\u2013302.","journal-title":"Israel J. of Math."},{"key":"BF02579348_CR13","unstructured":"E. Shamir andE. Upfal, Large regular factors in random graphs,Annals of Disc. Math. (1982), to appear."},{"key":"BF02579348_CR14","unstructured":"E. Shamir, Stochastic analysis of extension rotation algorithms. Submitted to 14annual ACM symp. on Theory of Computing, (1982)."},{"key":"BF02579348_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(82)90023-1","volume":"41","author":"E. Shamir","year":"1982","unstructured":"E. Shamir andE. Upfal, One factor in random graphs based on vertex-choice,Discrete Math. 41 (1982), 281\u2013286.","journal-title":"Discrete Math."},{"key":"BF02579348_CR16","unstructured":"T. I. Fenner andA. M. Frieze, On the existence of Hamiltonian cycles in a class of random graps,to appear."},{"key":"BF02579348_CR17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"J. Koml\u00f3s","year":"1983","unstructured":"J. Koml\u00f3s andE. Szemer\u00e9di, Limit distribution for the existence of Hamiltonian cycles in a random graph,Discrete Math. 43 (1983), 55\u201363.","journal-title":"Discrete Math."},{"key":"BF02579348_CR18","unstructured":"B. Bollob\u00e1s, Almost all regular graphs are Hamiltonian,to appear."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579348.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579348\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:02Z","timestamp":1558183502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["BF02579348"],"URL":"https:\/\/doi.org\/10.1007\/bf02579348","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}