Cycles in a random graph near the critical point
- 1 December 1991
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 2 (4) , 421-439
- https://doi.org/10.1002/rsa.3240020405
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the evolution of random graphsPublished by Walter de Gruyter GmbH ,2011
- Component behavior near the critical point of the random graph processRandom Structures & Algorithms, 1990
- On tree census and the giant component in sparse random graphsRandom Structures & Algorithms, 1990
- The first cycles in an evolving graphDiscrete Mathematics, 1989
- The chromatic number of random graphs at the double-jump thresholdCombinatorica, 1989
- The Isoperimetric Number of Random Regular GraphsEuropean Journal of Combinatorics, 1988
- On the Behavior of a Random Graph Near a Critical PointTheory of Probability and Its Applications, 1987
- On large matchings and cycles in sparse random graphsDiscrete Mathematics, 1986
- The Evolution of Random GraphsTransactions of the American Mathematical Society, 1984
- The longest path in a random graphCombinatorica, 1981