{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T04:03:00Z","timestamp":1774584180539,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>It is well known that the branching process approach to the study of the random graph $G_{n,p}$ gives a very simple way of understanding the size of the giant component when it is fairly large (of order $\\Theta(n)$). Here we show that a variant of this approach works all the way down to the phase transition: we use branching process arguments to give a simple new derivation of the asymptotic size of the largest component whenever $(np-1)^3n\\to\\infty$.<\/jats:p>","DOI":"10.37236\/2588","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:11:39Z","timestamp":1578694299000},"source":"Crossref","is-referenced-by-count":12,"title":["A Simple Branching Process Approach to the Phase Transition in $G_{n,p}$"],"prefix":"10.37236","volume":"19","author":[{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Riordan","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2012,11,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i4p21\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i4p21\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T17:23:07Z","timestamp":1579281787000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v19i4p21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,8]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2012,10,18]]}},"URL":"https:\/\/doi.org\/10.37236\/2588","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,8]]},"article-number":"P21"}}