{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:38:55Z","timestamp":1760161135140},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T00:00:00Z","timestamp":1378771200000},"content-version":"vor","delay-in-days":11059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1983,6]]},"DOI":"10.1016\/s0195-6698(83)80039-0","type":"journal-article","created":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T08:52:46Z","timestamp":1378803166000},"page":"97-106","source":"Crossref","is-referenced-by-count":29,"title":["Almost all Regular Graphs are Hamiltonian"],"prefix":"10.1016","volume":"4","author":[{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(83)80039-0_bib1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Computer and System Sciences"},{"key":"10.1016\/S0195-6698(83)80039-0_bib2","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","article-title":"The asymptotic number of labelled graphs with given degree sequences","volume":"24","author":"Bender","year":"1978","journal-title":"J. Combin. Theory Ser. (A)"},{"key":"10.1016\/S0195-6698(83)80039-0_bib3","series-title":"Graph Theory-An Introductory Course, Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9967-7","author":"Bollobas","year":"1979"},{"key":"10.1016\/S0195-6698(83)80039-0_bib4","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollobas","year":"1980","journal-title":"Europ. J. Combinatorics"},{"key":"10.1016\/S0195-6698(83)80039-0_bib5","series-title":"Combinatorics","first-page":"80","article-title":"Random Graphs","author":"Bollobas","year":"1981"},{"key":"10.1016\/S0195-6698(83)80039-0_bib6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1112\/jlms\/s2-26.2.201","article-title":"The asymptotic number of regular unlabelled graphs","volume":"26","author":"Bollobas","year":"1982","journal-title":"J. London Math. Soc. (2)"},{"key":"10.1016\/S0195-6698(83)80039-0_bib7","unstructured":"B. Bollobas, N.C. Wormald: Regular factors of regular graphs, to appear."},{"key":"10.1016\/S0195-6698(83)80039-0_bib8","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos","year":"1960","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/S0195-6698(83)80039-0_bib9","unstructured":"T.I. Fenner, A.M. Frieze: On the existence of Hamiltonian cycles in a class of random graphs, to appear."},{"key":"10.1016\/S0195-6698(83)80039-0_bib10","first-page":"1003","article-title":"Hamiltonian cycles in random graphs","volume":"10","author":"Komlos","year":"1975"},{"key":"10.1016\/S0195-6698(83)80039-0_bib11","unstructured":"J. Komlos, E. Szemeredi: The exact probability distribution of Hamiltonian cycles in random graphs, to appear."},{"key":"10.1016\/S0195-6698(83)80039-0_bib12","unstructured":"J. Komlos, E. Szemeredi: to appear."},{"key":"10.1016\/S0195-6698(83)80039-0_bib13","first-page":"760","article-title":"Solution of a problem of Erdos and Renyi on Hamilton cycles in nonoriented graphs","volume":"17","author":"Korshunov","year":"1976","journal-title":"Soviet Math. Doklad y"},{"key":"10.1016\/S0195-6698(83)80039-0_bib14","first-page":"17","article-title":"A solution of a problem of P. Erdos and A. Renyi about Hamilton cycles in non-oriented graphs (in Russian)","volume":"31","author":"Korshunov","year":"1977","journal-title":"Metody Diskr. Anal. v Teoriy Upr. Syst., Sbornik Trudov Novosibirsk"},{"key":"10.1016\/S0195-6698(83)80039-0_bib15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4153\/CMB-1972-008-3","article-title":"Almost all graphs have a spanning cycle","volume":"15","author":"Moon","year":"1972","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0195-6698(83)80039-0_bib16","first-page":"1376","article-title":"On two problems from the theory of graphs","volume":"11","author":"Perepelica","year":"1970","journal-title":"Soviet Mat. Dokl."},{"key":"10.1016\/S0195-6698(83)80039-0_bib17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"Posa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/S0195-6698(83)80039-0_bib18","unstructured":"W.F. de la Vega, Long paths in random graphs, to appear."},{"issue":"2","key":"10.1016\/S0195-6698(83)80039-0_bib19","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1112\/jlms\/s2-8.1.44","article-title":"For how many edges is a graph almost certainly Hamiltonian?","volume":"8","author":"Wright","year":"1974","journal-title":"J. London Math. Soc."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669883800390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669883800390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T02:23:29Z","timestamp":1539397409000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669883800390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["S0195669883800390"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(83)80039-0","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}