The largest component in critical random intersection graphs

DOI10.7151/dmgt.2052zbMath1392.05101OpenAlexW2792039420MaRDI QIDQ1656908

Longmin Wang, Bin Wang, Kai-Nan Xiang

Publication date: 10 August 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2052

zbMATH Keywords

scaling windowlargest componentcritical random intersection graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (1)

Size of the largest component in a critical graph

Cites Work

• Sharp threshold functions for random intersection graphs via a coupling method
• Sharp thresholds for Hamiltonicity in random intersection graphs
• Component evolution in random intersection graphs
• Critical random graphs: Diameter and mixing time
• The critical random graph, with martingales
• A note on the component structure in random intersection graphs with tunable clustering
• Critical percolation on random regular graphs
• Equivalence of a random intersection graph and G (n ,p )
• On Random Intersection Graphs: The Subgraph Problem
• The vertex degree distribution of random intersection graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Probability
• Unnamed Item
• Unnamed Item

This page was built for publication: The largest component in critical random intersection graphs