Random Graphs (Cambridge Studies in Advanced Mathematics, Series Number 73)

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.

Béla Bollobás has taught at Cambridge University's Department of Pure Maths and Mathematical Statistics for over 25 years and has been a fellow of Trinity College for 30 years. Since 1996, he has held the unique Chair of Excellence in the Department of Mathematical Sciences at the University of Memphis. Bollobás has previously written over 250 research papers in extremal and probabilistic combinatorics, functional analysis, probability theory, isoperimetric inequalities and polynomials of graphs.