Color-avoiding percolation on the Erdős-Rényi random graph

DOI10.5802/AHL.228MaRDI QIDQ6954169zbMATH OpenFDO

Authors Lyuben Lichev, Bruno Schapira

Publication date 24 July 2025

Published in Annales Henri Lebesgue (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5802/AHL.228

zbMATH Keywords

color-avoiding percolationErdős-Rényi random graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Cites work

• A Limit Theorem for Multidimensional Galton-Watson Processes
• Color-avoiding percolation and branching processes
• Large deviations techniques and applications.
• Lectures on the Poisson Process
• Random Graphs and Complex Networks
• Random graphs and complex networks. Volume 1
• Random graphs.
• The Random-Cluster Model

This page was built for publication: Color-avoiding percolation on the Erdős-Rényi random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6954169)