Weakly saturated subgraphs of random graphs

DOI10.1134/s1064562423700448zbMath1518.05170OpenAlexW4380490669MaRDI QIDQ6112963

B. Tayfeh-Rezaie, M. E. Zhukovskii, O. Kalinichenko

Publication date: 10 July 2023

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

Full work available at URL: https://doi.org/10.1134/s1064562423700448

zbMATH Keywords

random graphweak saturationbootstrap percolation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• An extremal problem for sets with applications to graph theory
• Hyperconnectivity of graphs
• Threshold functions for extension statements
• Weak saturation numbers of complete bipartite graphs in the clique
• Equitable coloring of random graphs
• Saturation in random graphs

This page was built for publication: Weakly saturated subgraphs of random graphs