{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:06:33Z","timestamp":1770325593292,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0097-3165(02)00017-1","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T11:04:10Z","timestamp":1046775850000},"page":"249-263","source":"Crossref","is-referenced-by-count":19,"title":["Asymptotic enumeration of sparse graphs with a minimum degree constraint"],"prefix":"10.1016","volume":"101","author":[{"given":"Boris","family":"Pittel","sequence":"first","affiliation":[]},{"given":"Nicholas C.","family":"Wormald","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0097-3165(02)00017-1_BIB1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/(SICI)1098-2418(199803)12:2<111::AID-RSA1>3.0.CO;2-#","article-title":"Maximum matchings in sparse random graphs","volume":"12","author":"Aronson","year":"1998","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0097-3165(02)00017-1_BIB2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0097-3165(73)90038-1","article-title":"Central and local limit theorems applied to asymptotic enumeration","volume":"15","author":"Bender","year":"1973","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0097-3165(02)00017-1_BIB3","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","article-title":"The asymptotic number of labeled graphs with given degree sequences","volume":"24","author":"Bender","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0097-3165(02)00017-1_BIB4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/rsa.3240010202","article-title":"The asymptotic number of labeled connected graphs with a given number of vertices and edges","volume":"1","author":"Bender","year":"1990","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0097-3165(02)00017-1_BIB5","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/jcta.1997.2798","article-title":"The asymptotic number of labeled graphs with n vertices, q edges, and no isolated vertices","volume":"80","author":"Bender","year":"1997","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0097-3165(02)00017-1_BIB6","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":"Bollob\u00e1s","year":"1980","journal-title":"European J. Combin."},{"key":"10.1016\/S0097-3165(02)00017-1_BIB7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","article-title":"On the strength of connectedness of a random graph","volume":"12","author":"Erd\u0151s","year":"1961","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0097-3165(02)00017-1_BIB8","unstructured":"A.D. Korshunov, On the number of graphs with a fixed number of vertices, edges, and isolated vertices (translation of Discrete Analysis (Russian), 93, Izdat. Ross. Akad. Nauk Sibirsk. Otdel. Inst. Mat., Novosibirsk, 1994, pp. 43\u201393) Siberian Adv. Math. 5 (1995) 50\u2013112."},{"key":"10.1016\/S0097-3165(02)00017-1_BIB9","unstructured":"T. \u0141uczak, Sparse random graphs with a given degree sequence, in: A. Frieze, T. \u0141uczak (Eds.), Random Graphs, Vol. 2, Wiley, New York, 1992, pp. 165\u2013182."},{"key":"10.1016\/S0097-3165(02)00017-1_BIB10","first-page":"15","article-title":"Asymptotics for symmetric 0-1 matrices with prescribed row sums","volume":"19A","author":"McKay","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/S0097-3165(02)00017-1_BIB11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01275671","article-title":"Asymptotic enumeration by degree sequence of graphs with degrees o(n1\/2)","volume":"11","author":"McKay","year":"1991","journal-title":"Combinatorica"},{"key":"10.1016\/S0097-3165(02)00017-1_BIB12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2307\/1427240","article-title":"Paths in a random digital tree","volume":"18","author":"Pittel","year":"1986","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/S0097-3165(02)00017-1_BIB13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/jctb.1996.0036","article-title":"Sudden emergence of a giant k-core in a random graph","volume":"67","author":"Pittel","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0097-3165(02)00017-1_BIB14","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1137\/0150073","article-title":"A graph-valued Markov process as rings-allowed polymerization model","volume":"50","author":"Pittel","year":"1990","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0097-3165(02)00017-1_BIB15","series-title":"Surveys in Combinatorics, 1999","first-page":"239","article-title":"Models of random regular graphs","volume":"Vol. 267","author":"Wormald","year":"1999"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316502000171?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316502000171?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T01:58:29Z","timestamp":1553651909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316502000171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0097316502000171"],"URL":"https:\/\/doi.org\/10.1016\/s0097-3165(02)00017-1","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}