On Matchings in Stochastic Kronecker Graphs

Electronic Journal Of Combinatorics

Justyna Banaszak¹ 

关键词: Random Graphs;    Stochastic Kronecker Graphs;    Perfect matching;    Factors;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 perfec

【 授权许可】

Others