Maximum matchings in a class of random graphs
- 1 April 1986
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 40 (2) , 196-212
- https://doi.org/10.1016/0095-8956(86)90077-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An exact threshold theorem for random graphs and the node-packing problemJournal of Combinatorial Theory, Series B, 1986
- On the existence of Hamiltonian cycles in a class of random graphsDiscrete Mathematics, 1983
- One-factor in random graphs based on vertex choiceDiscrete Mathematics, 1982
- On the connectivity of randomm-orientable graphs and digraphsCombinatorica, 1982
- Matchings in random regular bipartite digraphsDiscrete Mathematics, 1980
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947