On matchings in stochastic Kronecker graphs (Q727174)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On matchings in stochastic Kronecker graphs |
scientific article; zbMATH DE number 6661358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On matchings in stochastic Kronecker graphs |
scientific article; zbMATH DE number 6661358 |
Statements
On matchings in stochastic Kronecker graphs (English)
0 references
6 December 2016
0 references
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.
0 references
random graphs
0 references
stochastic Kronecker graphs
0 references
perfect matching
0 references
factors
0 references
0.806895911693573
0 references
0.8019492030143738
0 references
0.7790915966033936
0 references
0.7787544131278992
0 references
