Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method

  • Katarzyna Rybarczyk
DOI: https://doi.org/10.37236/523

Abstract

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.

Published
2011-02-14
Issue
Volume 18, Issue 1 (2011)
Article Number
P36