Random Graphs '85 (eBook)

Front Cover 1
Random Graphs '85 4
Copyright Page 5
Contents 7
Preface 6
List of Participants 8
Chapter 1. A variant of Banach’s match box problem 12
Chapter 2. The sensitivity of expected spanning trees in anisotropic random graphs 20
Chapter 3. On the strength of connectivity of random subgraphs of the n-cube 28
Chapter 4. Connectedness and connectivity in percolation theory 52
Chapter 5. Hamiltonian closure in random graphs 70
Chapter 6. Long paths and cycles in a random lattice 80
Chapter 7. The distribution of the number of empty cells in a generalized random allocation scheme 88
Chapter 8. Random self-avoiding walks in some one-dimensional lattices 102
Chapter 9. On a random digraph 122
Chapter 10. Additive weights of non-regularly distributed trees 140
Chapter 11. A tree enumeration problem involving the asymptotics of the “diagonals” of a power series 168
Chapter 12. On matchings and hamiltonian cycles in subgraphs of random graphs 182
Chapter 13. General percolation and oriented matroids 198
Chapter 14. Some enumerative results on series-parallel networks 210
Chapter 15. Unsolved problems in the theory of random graphs 238
Chapter 16. Some recent results on the register function of a binary tree 252
Chapter 17. Bounds for all-terminal reliability in planar networks 272
Chapter 18. Induced subgraphs in a random graph 286
Chapter 19. On a nonuniform random recursive tree 308
Chapter 20. Pseudo-random graphs 318
Chapter 21. On the independence number of random subgraphs of the n-cube 344
Chapter 22. Directed site percolation and dual filling models 350
Chapter 23. Random Graphs '85: Open problems 364