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 over 150 references means that this represents an up to date and comprehensive account of random graph theory. One of the aims of the theory (founded by Erdös and Rényi in the late fifties) is to estimate the number of graphs of a given order that exhibit certain properties. This is achieved with the use of probabilistic ideas as opposed to an exact deterministic approach. This theory 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.