The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  1. D. Aldous. Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25 (1997), 812-854. Math. Review 98d:60019
  2. B. Bollob·s. Random graphs Cambridge Studies in Advanced Mathematics. 73 (2001), Cambridge University Press, Cambridge, second edition. Math. Review 2002j:05132
  3. S. Janson, D.E. Knuth, T. Luczak, and B. Pittel. The birth of the giant component. Random Structures Algorithms 4 (1993), 231-358. Math. Review 94h:05070
  4. T. Luczak, B. Pittel, and J.C. Wierman. The structure of a random graph at the point of the phase transition. Trans. Amer. Math. Soc. 341 (1994), 721-748. Math. Review 94d:05123
  5. B. Pittel. On the largest component of the random graph at a nearcritical stage. J. Combin. Theory Ser. B 82 (2001), 237-269. Math. Review 2002j:05134
  6. J. Spencer. Enumerating graphs and Brownian motion. Comm. Pure Appl. Math. 50 (1997), 291-294. Math. Review 97k:05105
  7. E.M. Wright. The number of connected sparsely edged graphs. J. Graph Theory 1 (1977), 317-330. Math. Review 463026
  8. E.M. Wright. The number of connected sparsely edged graphs. II. Smooth graphs and blocks. J. Graph Theory 2 (1978), 299-305. Math. Review 0505805
  9. E.M. Wright. The number of connected sparsely edged graphs. III. Asymptotic results. J. Graph Theory 4 (1980), 393-407. Math. Review 82d:05070
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.