Weak saturation numbers in random graphs

DOI10.1002/JGT.70004MaRDI QIDQ6840322zbMATH OpenFDO

Authors Meysam Miralaei, A. Mohammadian, Olga Serkova, B. Tayfeh-Rezaie

Publication date 23 March 2026

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

Full work available at URL https://doi.org/10.1002/JGT.70004

zbMATH Keywords

asymptotic stabilityrandom graphweak saturation number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• A Problem in Graph Theory
• A survey of minimum saturated graphs
• An extremal problem for sets with applications to graph theory
• Eine Extremalaufgabe aus der Graphentheorie.
• Graph bootstrap percolation
• scientific article; zbMATH DE number 3561367 (Why is no real title available?)
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Hyperconnectivity of graphs
• Introduction to Random Graphs
• Saturation in random graphs
• Spanning Subgraphs of Random Graphs
• The probabilistic method
• The threshold for the square of a Hamilton cycle
• The weak saturation number of \(K_{2,t}\)
• Threshold for stability of weak saturation
• Threshold functions for extension statements
• Weak saturation numbers for sparse graphs
• Weak saturation numbers of complete bipartite graphs in the clique
• Weak saturation stability
• Weakly P-saturated graphs
• Weakly saturated random graphs

This page was built for publication: Weak saturation numbers in random graphs

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