Premium
Matchings in random spanning subgraphs of cubelike graphs
Author(s) -
Kostochka Alexandr V.
Publication year - 1990
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240010304
Subject(s) - combinatorics , bipartite graph , mathematics , conjecture , discrete mathematics , random graph , graph
A question about the evolution of random spanning subgraphs G p of bipartite regular so called cubelike graphs G is considered. It is shown that for G p 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.