Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime

DOI10.1016/j.disc.2023.113713zbMath1526.05125arXiv2301.09910OpenAlexW4387387432MaRDI QIDQ6080191

Lyuben Lichev

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

phase transitiongiant componentErdős-Rényi random graphCA-percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05)

Related Items (1)

Color-avoiding connected spanning subgraphs with minimum number of edges

Cites Work

• Introduction to Random Graphs
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process

This page was built for publication: Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime