Sharp threshold functions for random intersection graphs via a coupling method
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We present a new method which enables us to find threshold functions for many properties in random intersection graphs. This method is used to establish sharp threshold functions in random intersection graphs for $k$–connectivity, perfect matching containment and Hamilton cycle containment.
DOI : 10.37236/523
Classification : 05C80, 05C70
Mots-clés : random intersection graphs, threshold functions, connectivity, Hamilton cycle, perfect matching, coupling
@article{10_37236_523,
     author = {Katarzyna Rybarczyk},
     title = {Sharp threshold functions for random intersection graphs via a coupling method},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/523},
     zbl = {1229.05250},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/523/}
}
TY  - JOUR
AU  - Katarzyna Rybarczyk
TI  - Sharp threshold functions for random intersection graphs via a coupling method
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/523/
DO  - 10.37236/523
ID  - 10_37236_523
ER  - 
%0 Journal Article
%A Katarzyna Rybarczyk
%T Sharp threshold functions for random intersection graphs via a coupling method
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/523/
%R 10.37236/523
%F 10_37236_523
Katarzyna Rybarczyk. Sharp threshold functions for random intersection graphs via a coupling method. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/523

Cité par Sources :