Publication:4948019
From MaRDI portal
DOI<156::AID-RSA3>3.0.CO;2-H 10.1002/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO;2-HzbMath0951.05096MaRDI QIDQ4948019
James Allen Fill, Edward R. Scheinerman, Karen B. Singer-Cohen
Publication date: 13 December 2000
05C80: Random graphs (graph-theoretic aspects)
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
Related Items
Poisson Approximation of the Number of Cliques in Random Intersection Graphs, On the complexity of the herding attack and some related attacks on hash functions, On the isolated vertices and connectivity in random intersection graphs, A note on hamiltonicity of uniform random intersection graphs, Sharp thresholds for Hamiltonicity in random intersection graphs, A random intersection digraph: indegree and outdegree distributions, Expander properties and the cover time of random intersection graphs, Connectivity of the uniform random intersection graph, Diameter, connectivity, and phase transition of the uniform random intersection graph, Efficiently covering complex networks with cliques of similar vertices, The degree of a typical vertex in generalized random intersection graph models, Selected Combinatorial Properties of Random Intersection Graphs, Colouring Non-sparse Random Intersection Graphs, The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs, Epidemics on Random Graphs with Tunable Clustering
Cites Work