Geodesic
On matchings in stochastic Kronecker graphs
Justyna Banaszak1
1Adam Mickiewicz University
The electronic journal of combinatorics, Tome 23 (2016) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/5680
Classification : 05C80, 05C70, 05C65
Mots-clés : random graphs, stochastic Kronecker graphs, perfect matching, factors

Justyna Banaszak  1

1 Adam Mickiewicz University 
@article{10_37236_5680,
     author = {Justyna Banaszak},
     title = {On matchings in stochastic {Kronecker} graphs},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {4},
     doi = {10.37236/5680},
     zbl = {1351.05200},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5680/}
}
TY  - JOUR
AU  - Justyna Banaszak
TI  - On matchings in stochastic Kronecker graphs
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5680/
DO  - 10.37236/5680
ID  - 10_37236_5680
ER  - 
%0 Journal Article
%A Justyna Banaszak
%T On matchings in stochastic Kronecker graphs
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/5680/
%R 10.37236/5680
%F 10_37236_5680
Justyna Banaszak. On matchings in stochastic Kronecker graphs. The electronic journal of combinatorics, Tome 23 (2016) no. 4. doi: 10.37236/5680

Cité par Sources :