Perfect matchings in random intersection graphs
From MaRDI portal
Publication:2434152
DOI10.1007/s10474-012-0266-8zbMath1289.05441OpenAlexW2020272293MaRDI QIDQ2434152
Tomasz Łuczak, Mindaugas Bloznelis
Publication date: 17 February 2014
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10474-012-0266-8
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB ⋮ \(k\)-connectivity of uniform \(s\)-intersection graphs ⋮ The coupling method for inhomogeneous random intersection graphs.
Cites Work
- Sharp threshold functions for random intersection graphs via a coupling method
- Large independent sets in general random intersection graphs
- Connectivity of the uniform random intersection graph
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Tree-Matchings in Graph Processes
- On Random Intersection Graphs: The Subgraph Problem
- The vertex degree distribution of random intersection graphs
- Component evolution in a secure wireless sensor network
- Zero–One Laws for Connectivity in Random Key Graphs
- On the existence of a factor of degree one of a connected random graph
This page was built for publication: Perfect matchings in random intersection graphs