The phase transition in site percolation on pseudo-random graphs

zbMath1329.05264arXiv1404.5731MaRDI QIDQ907264

Michael Krivelevich

Publication date: 25 January 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5731

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Percolation (82B43)

Related Items (3)

Random subcube intersection graphs. I: Cliques and covering ⋮ Site percolation on pseudo‐random graphs ⋮ Supercritical site percolation on the hypercube: small components are small

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large components in random induced subgraphs of \(n\)-cubes
• The longest path in a random graph
• Sharp bounds for some multicolour Ramsey numbers
• The phase transition in random graphs: A simple proof
• The emergence of a giant component in random subgraphs of pseudo-random graphs
• Site Percolation on the d-Dimensional Hamming Torus

This page was built for publication: The phase transition in site percolation on pseudo-random graphs