Perfect matchings in random intersection graphs

Acta Mathematica Hungarica

Volumn 138, Issue 1-2, 2013, Pages 15-33

  Bloznelis, Mindaugas ^a   Łuczak, Tomasz ^b  

^a VILNIUS UNIVERSITY   (Lithuania)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

clustering; connectivity; perfect matching; random intersection graph

Indexed keywords

EID: 84871282381     PISSN: 02365294     EISSN: 15882632     Source Type: Journal    
DOI: 10.1007/s10474-012-0266-8     Document Type: Article

References (18)

1. S. Blackburn and S. Gerke, Connectivity of the uniform random intersection graph, Discrete Mathematics, 309 (2009), 5130-5140.
2. M. Bloznelis, J. Jaworski and K. Rybarczyk, Component evolution in a wireless sensor network, Networks, 53 (2009), 19-26.
3. B. Bollobás, Random Graphs, 2nd ed., Cambridge University Press (New York, 2001).
4. R. Di Pietro, L. V. Mancini, A. Mei, A. Panconesi and J. Radhakrishnan, Sensor networks that are provably resilient, in: Proc. 2nd IEEE Int. Conf. Security Privacy Emerging Areas Commun. Networks (SecureComm, 2006) (Baltimore, MD, 2006).
5. P. Erdo{double acute}s and A. Rényi, On the existence of a factor of degree one of a connected random graph, Acta Math. Acad. Sci. Hungar., 17 (1966), 359-368.
6. L. Eschenauer and V. D. Gligor, A key-management scheme for distributed sensor networks, in: Proceedings of the 9th ACM Conference on Computer and Communications Security (2002), pp. 41-47.
7. E. Godehardt and J. Jaworski, Two models of random intersection graphs for classification, in: O. Opitz, M. Schwaiger (Eds.) Studies in Classification, Data Analysis and Knowledge Organization22, Springer (Berlin-Heidelberg-New York, 2003), pp. 67-82.
8. E. Godehardt, J. Jaworski and K. Rybarczyk, Isolated vertices in random intersection graphs, in: A. Fink, B. Lausen, W. Seidel and A. Ultsch (Eds.) Studies in Classification, Data Analysis, and Knowledge Organization36, Springer Verlag (Heidelberg-Berlin, 2010), pp. 135-145.
9. S. Janson, T. Łuczak and A. Ruciński, Random Graphs, Wiley (New York, 2001).
10. M. Karoński, E. R. Scheinerman and K. B. Singer-Cohen, On random intersection graphs: The subgraph problem, Combinatorics, Probability and Computing, 8 (1999), 131-159.
11. L. Lovász, Combinatorial Problems and Exercises, North-Holland (Amsterdam, 1979).
12. T. Łuczak and A. Ruciński, Tree-matchings in graph processes, SIAM J. Discrete Math., 4 (1991), 107-120.
13. S. Nikoletseas, C. Raptopoulos and P. Spirakis, Large independent sets in general random intersection graphs, Theoretical Computer Science, 406 (2008), 215-224.
14. K. Rybarczyk, Sharp threshold functions for the random intersection graphs, The Electronic Journal of Combinatorics, 18 (2011), P36.
15. K. Rybarczyk, Diameter, connectivity, and phase transition of the uniform random intersection graph, Discrete Mathematics, 311 (2011), 1998-2019.
16. K. B. Singer-Cohen, Random intersection graphs, PhD thesis, Department of Mathematical Sciences, The Johns Hopkins University (1995).
17. D. Stark, The vertex degree distribution of random intersection graphs, Random Structures Algorithms, 24 (2004), 249-258.
18. O. Yagan and A. M. Makowski, Zero-one laws for connectivity in random key graphs, IEEE Transactions on Information Theory, 58 (2012), 2983-2999.