The book claims to be a successor of Prof. Bollobas' book of the same title. Unlike Prof. Bollobas' book, I do not think this one is a very good textbook: The proofs of many theorems are not given, but the reader is directed to some source; these theorems are not of some unrelated subject, but their topic is random graphs. These unproven theorems are then used in the sequel to prove other theorems. Furthermore, many proofs are delegated to "Excercises!", but no solutions are given.Thirdly (at least for me, I am not a professional mathematician), the presentation is at very uneven levels: Very easy derivations and extremely hard derivations are mixed together, it seems the authors have little feel for the difficulty of their exposition.On the positive side: The book is vitually typo-free, and the section on inequalities is much clearer -actually very good!- than the one in Prof. Bollobas's book.A curious aside: two pages (pages 180, 181) were simply missing, and they were also missing in a second copy I ordered. Neither Amazon, nor the publisher (Wiley) were of any help getting those two pages.
Author(s): A. Barlotti, M. Biliotti, A. Cossu, G. Korchmaros and G. Tallini (Eds.)
Series: North-Holland Mathematics Studies 144 / Annals of Discrete Mathematics 33
Edition: 2
Publisher: Elsevier Science Ltd
Year: 1987
Language: English
Commentary: +OCR
Pages: ii-ix, 1-354
Content:
General Editor
Page ii
Edited by
Page iii
Copyright page
Page iv
Preface
Page v
Michał Karoński, Zbigniew Palka
List of Participants
Pages vii-ix
A Variant of Banach's Match Box Problem Original Research Article
Pages 1-8
Sven Berg
The Sensitivity of Expected Spanning Trees in Anisotropic Random Graphs Original Research Article
Pages 9-16
Joel E. Cohen
On the Strength of Connectivity of Random Subgraphs of the n-Cube Original Research Article
Pages 17-40
M.E. Dyer, A.M. Frieze, L.R. Foulds
Connectedness and Connectivity in Percolation Theory Original Research Article
Pages 41-57
J.W. Essam
Hamiltonian Closure in Random Graphs Original Research Article
Pages 59-67
John Gimbel, David Kurtz, Linda Lesniak, Edward R. Scheinerman, John C. Wierman
Long Paths and Cycles in a Random Lattice Original Research Article
Pages 69-76
Geoffrey R. Grimmett
The Distribution of the Number of Empty Cells in a Generalized Random Allocation Scheme Original Research Article
Pages 77-90
Bernard Harris, Morris Marden, C.J. Park
Random Self-Avoiding Walks in some One-Dimensional Lattices Original Research Article
Pages 91-109
Svante Janson
On a Random Digraph Original Research Article
Pages 111-127
Jerzy Jaworski, Ipe H. Smit
Additive Weights of Non-Regularly Distributed Trees Original Research Article
Pages 129-155
Rainer Kemp
A Tree Enumeration Problem Involving the Asymptotics of the “Diagonals” of a Power Series Original Research Article
Pages 157-170
Peter Kirschenhofer
On Matchings and Hamiltonian Cycles in Subgraphs of Random Graphs Original Research Article
Pages 171-185
Tomasz Łuczak
General Percolation and Oriented Matroids Original Research Article
Pages 187-197
Colin McDiarmid
Some Enumerative Results on Series-Parallel Networks Original Research Article
Pages 199-226
John W. Moon
Unsolved Problems in the Theory of Random Graphs Original Research Article
Pages 227-239
Edgar M. Palmer
Some Recent Results on the Register Function of a Binary Tree Original Research Article
Pages 241-260
Helmut Prodinger
Bounds for All-Terminal Reliability in Planar Networks Original Research Article
Pages 261-273
Aparna Ramesh, Michael O. Ball, Charles J. Colbourn
Induced Subgraphs in a Random Graph Original Research Article
Pages 275-296
Andrzej Ruciński
On a Nonuniform Random Recursive Tree Original Research Article
Pages 297-306
Jerzy Szymański
Pseudo-Random Graphs Original Research Article
Pages 307-331
Andrew Thomason
On the Independence Number of Random Subgraphs of the n-Cube Original Research Article
Pages 333-337
Karl Weber
Directed Site Percolation and Dual Filling Models Original Research Article
Pages 339-352
John C. Wierman
Random Graphs '85: Open Problems
Pages 353-354
