UID:
almahu_9947367747302882
Format:
1 online resource (365 p.)
ISBN:
1-281-79811-8
,
9786611798116
,
0-08-087255-7
Series Statement:
North-Holland mathematics studies ; 144
Content:
Covering a wide range of Random Graphs subjects, this volume examines series-parallel networks, properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matchings, hamiltonian cycles and closure in such structures. Papers in this collection also illustrate various aspects of percolation theory and its applications, properties of random lattices and random walks on such graphs, random allocation schemes, pseudo-random graphs and reliability of planar networks. Several open problems
Note:
1st Seminar, 1983, entitled: Poznan Seminar on Random Graphs.
,
Front Cover; Random Graphs '85; Copyright Page; Contents; Preface; List of Participants; Chapter 1. A variant of Banach's match box problem; Chapter 2. The sensitivity of expected spanning trees in anisotropic random graphs; Chapter 3. On the strength of connectivity of random subgraphs of the n-cube; Chapter 4. Connectedness and connectivity in percolation theory; Chapter 5. Hamiltonian closure in random graphs; Chapter 6. Long paths and cycles in a random lattice; Chapter 7. The distribution of the number of empty cells in a generalized random allocation scheme
,
Chapter 8. Random self-avoiding walks in some one-dimensional latticesChapter 9. On a random digraph; Chapter 10. Additive weights of non-regularly distributed trees; Chapter 11. A tree enumeration problem involving the asymptotics of the "diagonals" of a power series; Chapter 12. On matchings and hamiltonian cycles in subgraphs of random graphs; Chapter 13. General percolation and oriented matroids; Chapter 14. Some enumerative results on series-parallel networks; Chapter 15. Unsolved problems in the theory of random graphs
,
Chapter 16. Some recent results on the register function of a binary treeChapter 17. Bounds for all-terminal reliability in planar networks; Chapter 18. Induced subgraphs in a random graph; Chapter 19. On a nonuniform random recursive tree; Chapter 20. Pseudo-random graphs; Chapter 21. On the independence number of random subgraphs of the n-cube; Chapter 22. Directed site percolation and dual filling models; Chapter 23. Random Graphs '85: Open problems
,
English
Additional Edition:
ISBN 0-444-70265-2
Language:
English
Bookmarklink