Perfect matchings in random intersection graphs

DOI10.1007/S10474-012-0266-8MaRDI QIDQ2434152zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

clusteringconnectivityperfect matchingrandom intersection graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 2127722
• Sharp threshold functions for random intersection graphs via a coupling method
• Connectivity of the uniform random intersection graph
• Maximum matchings in a class of random graphs
• \(k\)-connectivity of uniform \(s\)-intersection graphs

Cites work

• Component evolution in a secure wireless sensor network
• Connectivity of the uniform random intersection graph
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Large independent sets in general random intersection graphs
• On Random Intersection Graphs: The Subgraph Problem
• On the existence of a factor of degree one of a connected random graph
• Sharp threshold functions for random intersection graphs via a coupling method
• The vertex degree distribution of random intersection graphs
• Tree-Matchings in Graph Processes
• Zero–One Laws for Connectivity in Random Key Graphs

Cited in

(10)

• Exact matching of random graphs with constant correlation
• \(k\)-connectivity of uniform \(s\)-intersection graphs
• Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs
• Perfect matchings in random polyomino chain graphs
• Random matchings in regular graphs
• Maximum matchings in a pseudofractal scale-free web
• The number of perfect matchings, and the nesting properties, of random regular graphs
• A Fast Perfect-Matching Algorithm in Random Graphs
• On randomized stopping points and perfect graphs
• The coupling method for inhomogeneous random intersection graphs.

This page was built for publication: Perfect matchings in random intersection graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434152)