Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up-to-date and comprehensive account of random graph theory. The theory estimates the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.
Synopsis
This is a revised and updated version of the classic first edition.
Booknews
Probabilistic concepts have proven important in the study of graphs since Erdós and Rényi's founding of the theory of random graphs in the early 1960s. Their student, Bollobás (U. of Memphis; Trinity College, Cambridge), treats random graphs as evolving over time. "Our task is to determine at what stage of the evolution a particular property of the graph is likely to arise." Includes exercises of varying difficulty, and 38 pages of references relevant to such branches of math as number theory, combinatorics, and computer science. First published in 1985 by Academic Press. Annotation c. Book News, Inc., Portland, OR (booknews.com)