On Matchings in Stochastic Kronecker Graphs

  • Justyna Banaszak
Keywords: Random Graphs, Stochastic Kronecker Graphs, Perfect matching, Factors


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.

Author Biography

Justyna Banaszak, Adam Mickiewicz University
Ph.D. student, Faculty of Mathematics and Computer Science
Article Number