弱饱和稳定阈值
Threshold for weak saturation stability
摘要:
研究Erdens-Rényi随机图$\mathbbmsl{G}(n, p)$的弱$K_s$ -饱和数,记为$\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$,其中$K_s$是$s$顶点上的完全图. Korándi和Sudakov在2017年证明了$K_n$的弱$K_s$ -饱和数是稳定的,在这个意义上,它在以恒定概率去除边缘后保持不变。本文证明了这种稳定性存在一个阈值,并给出了阈值的上界和下界。这推广了Korandi和Sudakov的结果。还提供了$\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$的一般上界。
英文摘要:
We study the weak $K_s$-saturation number of the Erdős--Rényi random graph $\mathbbmsl{G}(n, p)$, denoted by $\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$, where $K_s$ is the complete graph on $s$ vertices. Korándi and Sudakov in 2017 proved that the weak $K_s$-saturation number of $K_n$ is stable, in the sense that it remains the same after removing edges with constant probability. In this paper, we prove that there exists a threshold for this stability property and give upper and lower bounds on the threshold. This generalizes the result of Korándi and Sudakov. A general upper bound for $\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$ is also provided.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。