Saturation in random graphs

DOI10.1002/rsa.20703zbMath1370.05191arXiv1510.09187OpenAlexW2963998228MaRDI QIDQ5360873

Dániel Korándi, Benjamin Sudakov

Publication date: 26 September 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphssaturationgraph bootstrap percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (13)

Rainbow Saturation and Graph Capacities ⋮ Weak saturation stability ⋮ Linearity of saturation for Berge hypergraphs ⋮ Weakly saturated subgraphs of random graphs ⋮ Rainbow Saturation for Complete Graphs ⋮ Cycle Saturation in Random Graphs ⋮ Tight concentration of star saturation number in random graphs ⋮ Star saturation number of random graphs ⋮ The \(Q_2\)-free process in the hypercube ⋮ Saturation number of Berge stars in random hypergraphs ⋮ Minimum clique-free subgraphs of Kneser graphs ⋮ Partite Saturation of Complete Graphs ⋮ Graph cover-saturation

This page was built for publication: Saturation in random graphs