Random Graphs

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)

Has taught at Cambridge department of pure maths and mathematical statistics for over 25 years and has been a fellow of Trinity College for 30 years. Since 1996 has held the unique Chair of Excellence in the dept of mathematical sciences at the university of Memphis. The author has previously written over 250 research papers in extremal and probabilistic combinatorics, functional analysis, probability theory, isoperimetric inequalities and polynomials of graphs.