## Random Subgraph(随机子图)研究综述

Random Subgraph 随机子图 - The independence number of random subgraphs of KG n , k 2 was recently addressed in a series of works by Bollobas et al.^{[1]}We study properties of random subgraphs of the graph G(n, r, s) in the Erdős-Rényi model, in which each edge is included in the subgraph with a certain fixed probability p independently of the other edges.

^{[2]}Consider a random subgraph of H obtained by including each vertex of G independently with a probability p, and including the edges for which both vertices are included.

^{[3]}

KG n , k 2 的随机子图的独立数最近在 Bollobas 等人的一系列作品中得到解决。

^{[1]}我们研究 Erdős-Rényi 模型中图 G(n, r, s) 的随机子图的性质，其中每条边都以某个固定概率 p 独立于其他边包含在子图中。

^{[2]}考虑通过以概率 p 独立包含 G 的每个顶点并包含包含两个顶点的边而获得的 H 的随机子图。

^{[3]}