On matchings in stochastic Kronecker graphs
type: Item
instance of: scholarly article
title: On matchings in stochastic Kronecker graphs
zbMATH Open document ID: 1351.05200
author: Justyna Banaszak
published in: The Electronic Journal of Combinatorics
publication date: 2016-12-06T00:00:00Z
full work available at URL: v23i4p6
review text: 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.
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6661358
zbMATH Keywords: random graphs
zbMATH Keywords: stochastic Kronecker graphs
zbMATH Keywords: perfect matching
zbMATH Keywords: factors
describes a project that uses: KronFit
MaRDI profile type: Publication
cites work: Q5691133
cites work: Stochastic kronecker graphs
cites work: Good lower and upper bounds on binomial coefficients
cites work: Kronecker graphs: an approach to modeling networks
cites work: An in-depth analysis of stochastic Kronecker graphs
cites work: Giant components in Kronecker graphs
cites work: Properties of stochastic Kronecker graphs
cites work: Connectivity and giant component of stochastic Kronecker graphs
description: scientific article; zbMATH DE number 6661358