Random graphs '87 : based on proceedings of the 3rd International Seminar on Random Graphs and Probabilistic Methods in Combinatorics, June 27 - July 3 1987, Poznań, Poland
Author(s)
Bibliographic Information
Random graphs '87 : based on proceedings of the 3rd International Seminar on Random Graphs and Probabilistic Methods in Combinatorics, June 27 - July 3 1987, Poznań, Poland
Wiley, c1990
- Other Title
-
Random graphs
Available at / 23 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
Description
This volume contains the proceedings of the Third International Seminar on random graphs and probabilistic methods in combinatorics - "Random Graphs '87" - which was held in Poznan between June 27 and July 3, 1987. The papers included in this volume reflect the variety of topics from over 30 talks presented at the meeting. Most of them concern various properties of random graphs of different kinds such as random binomial graphs, regular and out-regular graphs, random mappings, trees and forests. Others contribute to graph enumeration, percolation theory, the theory of parallel computation, statistical testing and the spread of information.
Table of Contents
- Sharp concentration of measure phenomena in the theory of random graphs, B.Bollobas
- property preserving spanning trees in random graphs, F.Buckley and Z. Palka
- pancyclic random graphs, C.Cooper and A.M.Frieze
- parallel colouring of random graphs, A.M.Frieze and L.Kucera
- Hamiltonian cycles in a class of random graphs - one step further, A.M.Frieze and T.Luczak
- connectivity of random graphs of small order and statistical testing, E.Godehardt
- an exponential bound for the probability of nonexistance of a specified subgraph of a random graph, S.Janson et al
- random mappings with independent choices of images, J.Jaworski
- further results on leftist trees, R.Kemp
- normal approximation and isolated vertices in random graphs, W.Kordecki
- on the existance of perfect codes in a random graph, J.Kratochvil et al
- on the equivalence of two basic models of random graphs, T.Luczak
- on the intersection graph of random arcs on a circle, H.Maehara
- an expose-and-merge algorithm and the chromatic number of a random graph, D.Matula and L.Kucera
- large components and cycles in a random mapping pattern
- L.Mutafchiev
- asymptotic distributions of graph statistics for coloured graphs, K.Nowicki
- random tree-type partitions as a model for acyclic polymerization - Gaussian behaviour of the subcritical sol phase, B.Pittel et al
- almost biparite-making graphs, H.J.Promel
- small subgraphs of random graphs - a survey, A.Rucinski
- undecidable probabilities, J.Spencer
- on the maximum degree and the height of a random recursive tree, J.szymanski
- almost all digraphs have a kernel, I.Tomescu
- first-passage percolation on the Voronoi tessellation and Delaunay triangulation, M.Q.Vahidi-Asl and J.C.Wierman
- random spread of information, random graph processes and random walks, K.Weber.
by "Nielsen BookData"
