Maximum Matchings in a Class of Random Graphs.
Abstract
This paper is concerned with graphs which suffice as an approximate model of a sparse random graph with a lower bound of m on the vertex degrees. Additional keywords: Set theory, random variables.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1984
- Accession Number
- ADA149663
Entities
People
- A. M. Frieze
Organizations
- Carnegie Mellon University