A question about the evolution of random spanning subgraphs Gp of bipartite regular so called cubelike graphs G is considered. It is shown that for Gp of any large enough cubelike graph G the threshold to have a 1‐factor is the same as the threshold to have no isolated vertices. This generalizes a conjecture of K. Weber.
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics