Size of the largest component in a critical graph

DOI10.1155/2019/1731802zbMath1435.05184OpenAlexW2972842658MaRDI QIDQ2298120

Lang Zou, Bin Wang

Publication date: 20 February 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/1731802

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp threshold functions for random intersection graphs via a coupling method
• Component evolution in random intersection graphs
• The critical random graph, with martingales
• A note on the component structure in random intersection graphs with tunable clustering
• The largest component in critical random intersection graphs
• A simple branching process approach to the phase transition in \(G_{n,p}\)
• Random Graphs and Complex Networks
• Critical percolation on random regular graphs
• On Random Intersection Graphs: The Subgraph Problem
• The Phase Transition in Multitype Binomial Random Graphs