Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Books
  3. Random Graphs
  • Cited by 2269
  • 2nd edition
  • Béla Bollobás, Trinity College, Cambridge and University of Memphis
Publisher:
Cambridge University Press
Online publication date:
March 2011
Print publication year:
2001
Online ISBN:
9780511814068
DOI:
https://doi.org/10.1017/CBO9780511814068
Subjects:
Mathematics (general), Mathematics, Discrete Mathematics Information Theory and Coding
Series:
Cambridge Studies in Advanced Mathematics (73)
Information

Book description

In this second 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 a comprehensive account of random graph theory. The theory (founded by Erdös and Rényi in the late fifties) aims to estimate 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.

Reviews

‘… contains an enormous amount of material, assembled by one who has played a leading role in the development of the area.’

Source: Zentralblatt MATH

‘This book, written by one of the leaders in the field, has become the bible of random graphs. This book is primarily for mathematicians interested in graph theory and combinatorics with probability and computing, but it could also be of interest to computer scientists. It is self-contained and lists numerous exercises in each chapter. As such, it is an excellent textbook for advanced courses or for self-study.‘

Source: EMS

‘There are many beautiful results in the theory of random graphs, and the main aim of the book is to introduce the reader and extensive account of a substantial body of methods and results from the theory of random graphs. This is a classic textbook suitable not only for mathematicians. It has clearly passed the test of time.‘

Source: Internationale Mathematische Nachrichten

‘… a very good and handy guidebhook for researchers.’

Source: Acta Scientiarum Mathematicarum

'The book is very impressive in the wealth of information it offers. It is bound to become a reference material on random graphs.'

Source: SIGACT News

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Contents

Contents

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.