On factors in random graphs
- 1 December 1981
- journal article
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 39 (4) , 296-302
- https://doi.org/10.1007/bf02761675
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- The Subgraph ProblemPublished by Elsevier ,1978
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On the existence of a factor of degree one of a connected random graphActa Mathematica Hungarica, 1966
- On the strength of connectedness of a random graphActa Mathematica Hungarica, 1964