Random GraphsCambridge University Press, 30.08.2001 - 498 Seiten 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. |
Inhalt
IV | 1 |
V | 5 |
VI | 9 |
VII | 15 |
VIII | 25 |
IX | 34 |
XI | 43 |
XII | 46 |
XLIX | 243 |
L | 245 |
LI | 248 |
LII | 251 |
LIII | 254 |
LIV | 264 |
LV | 267 |
LVI | 271 |
XIII | 50 |
XIV | 60 |
XV | 65 |
XVI | 69 |
XVII | 72 |
XVIII | 74 |
XIX | 78 |
XX | 79 |
XXI | 85 |
XXII | 91 |
XXIII | 96 |
XXV | 102 |
XXVI | 110 |
XXVII | 117 |
XXVIII | 130 |
XXIX | 138 |
XXX | 143 |
XXXI | 148 |
XXXII | 153 |
XXXIII | 160 |
XXXIV | 161 |
XXXV | 166 |
XXXVI | 171 |
XXXVII | 178 |
XXXVIII | 189 |
XXXIX | 195 |
XL | 201 |
XLI | 202 |
XLII | 206 |
XLIII | 212 |
XLIV | 219 |
XLV | 221 |
XLVI | 224 |
XLVII | 229 |
XLVIII | 241 |
LVII | 276 |
LVIII | 282 |
LIX | 290 |
LX | 294 |
LXI | 298 |
LXII | 303 |
LXIII | 319 |
LXIV | 320 |
LXV | 324 |
LXVI | 332 |
LXVII | 339 |
LXVIII | 341 |
LXIX | 348 |
LXX | 357 |
LXXI | 365 |
LXXII | 373 |
LXXIII | 376 |
LXXIV | 383 |
LXXV | 384 |
LXXVI | 394 |
LXXVII | 399 |
LXXVIII | 408 |
LXXIX | 412 |
LXXX | 425 |
LXXXI | 426 |
LXXXII | 431 |
LXXXIII | 435 |
LXXXIV | 442 |
LXXXV | 447 |
LXXXVI | 448 |
LXXXVII | 451 |
LXXXVIII | 455 |
457 | |
496 | |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
1-factors a.e. Gp assertion asymptotic bipartite graph Bo(G Bollobás c₁ Chapter Chebyshev's inequality chromatic number clique number colouring Combinatorial component of order connected Consequently constant contains Corollary cubic graphs deduce define degree sequence Denote diameter disjoint distribution elements Erdős and Rényi expected number fixed Frieze Furthermore G₁ Ge/n giant component Gr-reg graph G graph of order Graph Theory greedy algorithm Hamilton cycles Hamiltonian Hence implies induced subgraph inequality integer isomorphic k-core Komlós labelled graphs Lemma log log logn lower bound M₁ Math maximal minimum degree natural number number of vertices pairs Paley graph partition Poisson Poisson distribution precisely probability space proof of Theorem proved r-regular r.vs random graphs regular graphs result satisfies subgraph sufficiently large Suppose Theorem threshold function tree components trees of order upper bound vertex set vertices of degree
Verweise auf dieses Buch
Introduction To Algorithms Thomas H Cormen,Charles E Leiserson,Ronald L Rivest,Clifford Stein Eingeschränkte Leseprobe - 2001 |