{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T20:03:30Z","timestamp":1698523410652},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1006\/jctb.2000.2033","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T09:38:25Z","timestamp":1032341905000},"page":"237-269","source":"Crossref","is-referenced-by-count":22,"title":["On the Largest Component of the Random Graph at a Nearcritical Stage"],"prefix":"10.1006","volume":"82","author":[{"given":"Boris","family":"Pittel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jctb.2000.2033_RF1","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1214\/aop\/1024404421","article-title":"Brownian excursions, critical random graphs and the multiplicative coalescent","volume":"25","author":"Aldous","year":"1997","journal-title":"Ann. Probab."},{"key":"10.1006\/jctb.2000.2033_RF2","first-page":"3","article-title":"Slucha\u0131nye grafy so stepen'iu sviznosti 2","volume":"22","author":"Bagaev","year":"1973","journal-title":"Discretny\u0131 Analiz"},{"key":"10.1006\/jctb.2000.2033_RF3","first-page":"1061","article-title":"Perechislenie sviaznykh otmechennykh dvudol'nykh grafov","volume":"28","author":"Bagaev","year":"1984","journal-title":"Dokl. Akad. Nauk BSSR"},{"key":"10.1006\/jctb.2000.2033_RF4","series-title":"Higher Transcendental Functions I","author":"Bateman","year":"1953"},{"key":"10.1006\/jctb.2000.2033_RF5","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 Structures Algorithms"},{"key":"10.1006\/jctb.2000.2033_RF6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.2307\/1999405","article-title":"The evolution of random graphs","volume":"286","author":"Bollob\u00e1s","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1006\/jctb.2000.2033_RF7","series-title":"Graph Theory and Combinatorics (Proc. Cambridge Combinatorial Conf. in Honour of Paul Erd\u0151s)","article-title":"The evolution of sparse random graphs","author":"Bollob\u00e1s","year":"1984"},{"key":"10.1006\/jctb.2000.2033_RF8","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1006\/jctb.2000.2033_RF9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1515\/dma.1991.1.3.301","article-title":"On the random graph structure near the critical point","volume":"1","author":"Britikov","year":"1991","journal-title":"Discrete Math. Appl."},{"key":"10.1006\/jctb.2000.2033_RF10","series-title":"Probability: Theory and Examples","author":"Durrett","year":"1996"},{"key":"10.1006\/jctb.2000.2033_RF11","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s","year":"1960","journal-title":"Tud. Akad. Mat. Kut. Int\u00e9z K\u00f6zl"},{"key":"10.1006\/jctb.2000.2033_RF12","series-title":"Table of Integrals, Series, and Products","author":"Gradshteyn","year":"2000"},{"key":"10.1006\/jctb.2000.2033_RF13","series-title":"Independent and Stationary Random Variables","author":"Ibragimov","year":"1965"},{"key":"10.1006\/jctb.2000.2033_RF14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/rsa.3240040303","article-title":"The birth of the giant component","volume":"4","author":"Janson","year":"1993","journal-title":"Random Structures Algorithms"},{"key":"10.1006\/jctb.2000.2033_RF15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/1131058","article-title":"On the behaviour of a random graph near a critical point","volume":"31","author":"Kolchin","year":"1986","journal-title":"Theory Probab. Appl."},{"key":"10.1006\/jctb.2000.2033_RF16","unstructured":"T. \u0141uczak, On the equivalence of two basic models of random graphs, in Random Graphs '87, Proceedings of the 3rd International Seminar on Random Graphs and Probabilistic Methods in Combinatorics, pp. 151\u2013157, Wiley, New York, 1990."},{"key":"10.1006\/jctb.2000.2033_RF17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/rsa.3240010305","article-title":"Component behavior near the critical point of the random graph process","volume":"1","author":"\u0141uczak","year":"1990","journal-title":"Random Structures Algorithms"},{"key":"10.1006\/jctb.2000.2033_RF18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1017\/S0963548300000067","article-title":"Components of random forests","volume":"1","author":"\u0141uczak","year":"1992","journal-title":"Combinatorics, Probab. Comput."},{"key":"10.1006\/jctb.2000.2033_RF19","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1090\/S0002-9947-1994-1138950-5","article-title":"The structure of a random graph at the point of the phase transition","volume":"341","author":"\u0141uczak","year":"1994","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1006\/jctb.2000.2033_RF20","series-title":"Counting Labelled Trees","author":"Moon","year":"1970"},{"key":"10.1006\/jctb.2000.2033_RF21","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0196-6774(87)90040-X","article-title":"Linear probing: the probable largest search time grows logarithmically with the number of records","volume":"8","author":"Pittel","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1006\/jctb.2000.2033_RF22","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/rsa.3240010306","article-title":"On tree census and the giant component in sparse random graphs","volume":"1","author":"Pittel","year":"1990","journal-title":"Random Structures Algorithms"},{"key":"10.1006\/jctb.2000.2033_RF23","first-page":"385","article-title":"On connected graphs I","volume":"4","author":"R\u00e9nyi","year":"1959","journal-title":"Publ. Math. Inst. Hungarian Acad. Sci."},{"key":"10.1006\/jctb.2000.2033_RF24","unstructured":"J. Spencer, A query circulated in Summer of 2000."},{"key":"10.1006\/jctb.2000.2033_RF25","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/(SICI)1097-0312(199703)50:3<291::AID-CPA4>3.0.CO;2-6","article-title":"Enumerating graphs and Brownian motion","volume":"50","author":"Spencer","year":"1997","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1006\/jctb.2000.2033_RF26","series-title":"Enumerative Combinatorics II","author":"Stanley","year":"1999"},{"key":"10.1006\/jctb.2000.2033_RF27","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/1115027","article-title":"Phase transitions in random graphs","volume":"15","author":"Stepanov","year":"1970","journal-title":"Theory Probab. Appl."},{"key":"10.1006\/jctb.2000.2033_RF28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/1115004","article-title":"On the probability of connectedness of a random graph Gm(t)","volume":"15","author":"Stepanov","year":"1970","journal-title":"Theory Probab. Appl."},{"key":"10.1006\/jctb.2000.2033_RF29","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/1132091","article-title":"On some features of the structure of a random graph near a critical point","volume":"32","author":"Stepanov","year":"1988","journal-title":"Theory Probab. Appl."},{"key":"10.1006\/jctb.2000.2033_RF30","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1007\/BF01137454","article-title":"Wright and Stepanov\u2013Wright coefficients","volume":"42","author":"Voblyi","year":"1987","journal-title":"Math. Notes"},{"key":"10.1006\/jctb.2000.2033_RF31","series-title":"Generatingfunctionology","author":"Wilf","year":"1994"},{"key":"10.1006\/jctb.2000.2033_RF32","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/jgt.3190010407","article-title":"The number of connected sparsely edged graphs","volume":"1","author":"Wright","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1006\/jctb.2000.2033_RF33","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/jgt.3190040409","article-title":"The number of connected sparsely edged graphs. III: Asymptotic results","volume":"4","author":"Wright","year":"1980","journal-title":"J. Graph Theory"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895600920331?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895600920331?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T06:27:59Z","timestamp":1557296879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895600920331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0095895600920331"],"URL":"https:\/\/doi.org\/10.1006\/jctb.2000.2033","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}