The emergence of a giant component in random subgraphs of pseudo-random graphs
From MaRDI portal
Publication:4446876
DOI10.1002/rsa.10100zbMath1031.05118arXiv1605.06643OpenAlexW3100974711WikidataQ57401518 ScholiaQ57401518MaRDI QIDQ4446876
Ryan R. Martin, Michael Krivelevich, Alan M. Frieze
Publication date: 3 February 2004
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.06643
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (10)
Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs ⋮ Site percolation on pseudo‐random graphs ⋮ Speeding up random walk mixing by starting from a uniform vertex ⋮ Unnamed Item ⋮ The phase transition in site percolation on pseudo-random graphs ⋮ On percolation and ‐hardness ⋮ Percolation on dense graph sequences ⋮ Vertex percolation on expander graphs ⋮ The phase transition in random graphs: A simple proof ⋮ Spectrum of Johnson graphs
This page was built for publication: The emergence of a giant component in random subgraphs of pseudo-random graphs
