Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method
Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method
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.