Maximum Matchings in a Class of Random Graphs.
Management science research rept.,
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
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.
- Theoretical Mathematics