Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 277-285 |
| Number of pages | 9 |
| Journal | Random Structures & Algorithms |
| Volume | 1 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1990 |
| Externally published | Yes |
ASJC Scopus subject areas
- Software
- General Mathematics
- Computer Graphics and Computer-Aided Design
- Applied Mathematics