The Giant Component in a Random Subgraph of a Given Graph

DOI10.1007/978-3-540-95995-3_4MaRDI QIDQ3601166zbMATH OpenOpenAlexFDO

Authors Paul Horn, Linyuan Lu, Fan Chung

Publication date 10 February 2009

Published in Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-95995-3_4

zbMATH Keywords

random subgraphgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Percolation in general graphs
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Percolation on dense graph sequences
• The sharp threshold for percolation on expander graphs

Cited in

(9)

• Rigidity of random subgraphs and eigenvalues of stiffness matrices
• Giant components in random graphs
• scientific article; zbMATH DE number 7651057 (Why is no real title available?)
• How to determine if a random graph with a fixed degree sequence has a giant component
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• Clique percolation
• Percolation in general graphs
• The Largest Component in Subcritical Inhomogeneous Random Graphs
• Fast canonical labeling of random subgraphs

This page was built for publication: The Giant Component in a Random Subgraph of a Given Graph

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