The giant component after percolation of product graphs

DOI10.1002/jgt.22758zbMath1522.05398arXiv2103.07325OpenAlexW3209196274MaRDI QIDQ6057661

Lyuben Lichev

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

percolationsharp thresholdrandom graphproduct graphgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypercube percolation
• Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
• Largest random component of a k-cube
• Evolution of the \(n\)-cube
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Percolation on finite graphs and isoperimetric inequalities.
• Edge isoperimetric inequalities for product graphs
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• On the strength of connectedness of a random graph
• Random Subgraphs in Sparse Graphs
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The Evolution of Random Subgraphs of the Cube
• Isoperimetric Inequalities for Cartesian Products of Graphs
• Slightly subcritical hypercube percolation
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Percolation in General Graphs

This page was built for publication: The giant component after percolation of product graphs