TY  - BOOK
AU  - Béla Bollobás
TI  - Random graphs
SN  - 9780521797221
AV  - QA166.17 
PY  - 2001///]
CY  - Cambridge University Press
PB  - Cambridge, U.K.
KW  - Mathematics
N1  - 1 - Probability Theoretic Preliminaries
2 - Models of Random Graphs 
3 - The Degree Sequence 
4 - Small Subgraphs 
5 - The Evolution of Random Graphs—Sparse Components 
6 - The Evolution of Random Graphs—the Giant Component
7 - Connectivity and Matchings 
8 - Long Paths and Cycles 
9 - The Automorphism Group 
10 - The Diameter 
11 - Cliques, Independent Sets and Colouring 
12 - Ramsey Theory 
13 - Explicit Constructions 
14 - Sequences, Matrices and Permutations 
15 - Sorting Algorithms 
16 - Random Graphs of Small Order
N2  - 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.--- summary provided by publisher
ER  -