Sharp thresholds for Hamiltonicity in random intersection graphs
Theor. Comput. Sci., pp. 3714-3730, 2010.
edge dependencyrandom graphn vertexrandom subsetgraph propertyMore(13+)
Random Intersection Graphs, G"n","m","p, is a class of random graphs introduced in Karonski (1999)  where each of the n vertices chooses independently a random subset of a universal set of m elements. Each element of the universal sets is chosen independently by some vertex with probability p. Two vertices are joined by an edge iff the...More
Full Text (Upload PDF)
PPT (Upload PPT)