The Giant Component in a Random Subgraph of a Given Graph

DOI10.1007/978-3-540-95995-3_4zbMATH Open1207.05177OpenAlexW2142098932MaRDI QIDQ3601166FDOQ3601166

Paul Horn, Fan Chung, Linyuan Lu

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

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

zbMATH Keywords

random subgraphgiant component

Mathematics Subject Classification ID

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

Cited In (7)

• Fast canonical labeling of random subgraphs
• The Largest Component in Subcritical Inhomogeneous Random Graphs
• Giant components in random graphs
• Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices
• Title not available (Why is that?)
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• How to determine if a random graph with a fixed degree sequence has a giant component

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)