Sharp threshold functions for the random intersection graph via coupling method?
classification
🧮 math.CO
keywords
functionsintersectionmethodrandomthresholdcontainmentgraphssharp
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.