Random Graphs: 3rd, 1987

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.