K-connectivity of uniform s-intersection graphs

Citations of this article
Mendeley users who have this article in their library.


Let W1,⋯,Wn be independent random subsets of [m]={1,⋯,m}. Assuming that each Wi is uniformly distributed in the class of d-subsets of [m] we study the uniform random intersection graph Gs(n,m,d) on the vertex set {W1,⋯ Wn}, defined by the adjacency relation: Wi∼ Wj whenever |Wi∩ Wj|≥s. We show that as n,m→∞ the edge density threshold for the property that each vertex of Gs(n,m,d) has at least k neighbours is asymptotically the same as that for G s(n,m,d) being k-connected. © 2014 Elsevier B.V. All rights reserved.




Bloznelis, M., & Rybarczyk, K. (2014). K-connectivity of uniform s-intersection graphs. Discrete Mathematics, 333, 94–100. https://doi.org/10.1016/j.disc.2014.06.014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free