On matchings in stochastic Kronecker graphs
Summary: The stochastic Kronecker graph is a random structure whose vertex set is a hypercube and the probability of an edge depends on the structure of its ends. We prove that a.a.s. as soon as the stochastic Kronecker graph becomes connected it contains a perfect matching.
scientific article; zbMATH DE number 6661358