## Random GraphsThis 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. |

### What people are saying - Write a review

User Review - Flag as inappropriate

Here is an interesting article concerning the growth of a giant component :

http://expertvoices.nsdl.org/cornell-info204/2008/03/06/the-formation-of-a-giant-component/

### Contents

IV | 1 |

V | 5 |

VI | 9 |

VII | 15 |

VIII | 25 |

IX | 34 |

XI | 43 |

XII | 46 |

LIV | 243 |

LV | 245 |

LVI | 248 |

LVII | 251 |

LVIII | 254 |

LIX | 264 |

LX | 267 |

LXI | 271 |

XIII | 50 |

XIV | 60 |

XVII | 65 |

XVIII | 69 |

XIX | 72 |

XX | 74 |

XXI | 78 |

XXII | 79 |

XXIII | 85 |

XXIV | 91 |

XXV | 96 |

XXVII | 102 |

XXVIII | 110 |

XXIX | 117 |

XXX | 130 |

XXXIII | 138 |

XXXIV | 143 |

XXXV | 148 |

XXXVI | 153 |

XXXVII | 160 |

XXXVIII | 161 |

XXXIX | 166 |

XL | 171 |

XLI | 178 |

XLII | 189 |

XLIII | 195 |

XLIV | 201 |

XLVI | 202 |

XLVII | 206 |

XLVIII | 212 |

XLIX | 219 |

L | 221 |

LI | 224 |

LII | 229 |

LIII | 241 |

LXII | 276 |

LXIII | 282 |

LXIV | 290 |

LXV | 294 |

LXVI | 298 |

LXVII | 303 |

LXVIII | 319 |

LXIX | 320 |

LXX | 324 |

LXXI | 332 |

LXXII | 339 |

LXXIII | 341 |

LXXIV | 348 |

LXXV | 357 |

LXXVI | 365 |

LXXVII | 373 |

LXXVIII | 376 |

LXXIX | 383 |

LXXX | 384 |

LXXXI | 394 |

LXXXII | 399 |

LXXXIII | 408 |

LXXXIV | 412 |

LXXXV | 425 |

LXXXVI | 426 |

LXXXVII | 431 |

LXXXVIII | 435 |

LXXXIX | 442 |

XC | 447 |

XCI | 448 |

XCII | 451 |

XCIII | 455 |

457 | |

496 | |

### Other editions - View all

### Common terms and phrases

a.e. Gp a.e. graph process assertion asymptotic bipartite graph Bollobas Chapter Chebyshev's inequality chromatic number clique number colouring Combinatorial component of order connected Consequently constant constructed contains Corollary cubic graphs deduce define degree sequence Denote diameter disjoint distribution elements Erdos Erdos and Renyi expected number fixed Frieze Furthermore giant component given graph G graph of order Graph Theory greedy algorithm Hamilton cycles Hamiltonian Hence implies induced subgraph inequality integer isomorphic joined k-core labelled graphs Lemma log log log2 logn lower bound Math matrix maximal minimum degree natural number number of vertices oſn Paley graph partition Poisson Poisson distribution precisely probability space Proof Let proof of Theorem proved r-regular random graphs regular graphs result satisfies subgraph subsets sufficiently large Suppose threshold function tree components tree of order triangle-free graph upper bound vertex set vertices of degree