On large matchings and cycles in sparse random graphs
- 31 May 1986
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 59 (3) , 243-256
- https://doi.org/10.1016/0012-365x(86)90171-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the existence of Hamiltonian cycles in a class of random graphsDiscrete Mathematics, 1983
- Limit distribution for the existence of hamiltonian cycles in a random graphDiscrete Mathematics, 1983
- Long paths in sparse random graphsCombinatorica, 1982
- The longest path in a random graphCombinatorica, 1981
- Clutter percolation and random graphsPublished by Springer Nature ,1980
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On the existence of a factor of degree one of a connected random graphActa Mathematica Hungarica, 1966