Complete matchings in random subgraphs of the cube
Abstract
In this article it is shown that for almost every random cube process the hitting time of a complete matching equals the hitting time of having minimal degree (at least) one and also the hitting time of connectedness. It follows from this that if t = (n + c + o(1))2n−2 for some constant c, then the probability that a random subgraph of the n‐cube having precisely t edges has a complete matching tends to e −e −e −c. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
Publication Title
Random Structures & Algorithms
Recommended Citation
Bollobás, B. (1990). Complete matchings in random subgraphs of the cube. Random Structures & Algorithms, 1 (1), 95-104. https://doi.org/10.1002/rsa.3240010107
COinS
