Sharp threshold functions for the random intersection graph via coupling method?
Combinatorics
2013-01-04 v2
Abstract
We will present a new method, which enables us to find threshold functions for many properties in random intersection graphs. This method will be used to establish sharp threshold functions in random intersection graphs for k-connectivity, perfect matching containment and Hamilton cycle containment.
Cite
@article{arxiv.0910.0749,
title = {Sharp threshold functions for the random intersection graph via coupling method?},
author = {Katarzyna Rybarczyk},
journal= {arXiv preprint arXiv:0910.0749},
year = {2013}
}