Saturation in random graphs

DOI10.1002/RSA.20703zbMATH Open1370.05191arXiv1510.09187OpenAlexW2963998228MaRDI QIDQ5360873FDOQ5360873

Authors: Dániel Korándi, Benny Sudakov 

Publication date: 26 September 2017

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

Abstract: A graph $H$ is $K_s$-saturated if it is a maximal $K_s$-free graph, i.e., $H$ contains no clique on $s$ vertices, but the addition of any missing edge creates one. The minimum number of edges in a $K_s$-saturated graph was determined over 50 years ago by Zykov and independently by ErdH{o}s, Hajnal and Moon. In this paper, we study the random analog of this problem: minimizing the number of edges in a maximal $K_s$-free subgraph of the ErdH{o}s-R'enyi random graph $G(n,p)$. We give asymptotically tight estimates on this minimum, and also provide exact bounds for the related notion of weak saturation in random graphs. Our results reveal some surprising behavior of these parameters.

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

Recommendations

• Cycle Saturation in Random Graphs
• Star saturation number of random graphs
• Tight concentration of star saturation number in random graphs
• On the saturation number of graphs
• Graph saturation in multipartite graphs
• Publication:4865687
• Asymptotic results on saturated graphs
• Saturating the random graph with an independent family of small range
• scientific article; zbMATH DE number 18981
• Weakly saturated subgraphs of random graphs

zbMATH Keywords

saturationrandom graphsgraph bootstrap percolation

Mathematics Subject Classification ID

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

Cited In (17)

• The \(Q_2\)-free process in the hypercube
• Saturation number of Berge stars in random hypergraphs
• Graph cover-saturation
• The minimum number of clique-saturating edges
• Linearity of saturation for Berge hypergraphs
• Saturation problems in the Ramsey theory of graphs, posets and point sets
• Weakly saturated random graphs
• Partite saturation of complete graphs
• Tight concentration of star saturation number in random graphs
• Weak saturation stability
• Cycle Saturation in Random Graphs
• Star saturation number of random graphs
• Rainbow saturation and graph capacities
• Threshold for stability of weak saturation
• Minimum clique-free subgraphs of Kneser graphs
• Weakly saturated subgraphs of random graphs
• Rainbow Saturation for Complete Graphs

This page was built for publication: Saturation in random graphs

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