An exact threshold theorem for random graphs and the node-packing problem
- 1 April 1986
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 40 (2) , 187-195
- https://doi.org/10.1016/0095-8956(86)90076-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Maximum matchings in a class of random graphsJournal of Combinatorial Theory, Series B, 1986
- Random near-regular graphs and the node packing problemOperations Research Letters, 1985
- Minimum node covers and 2-bicritical graphsMathematical Programming, 1979
- Limit theorems for complete subgraphs of random graphsPeriodica Mathematica Hungarica, 1979
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975