On Stability of the Independence Number of a Certain Distance Graph
We study the asymptotic behavior of the independence number of a random subgraph of a certain (r,s)-distance graph. We provide upper and lower bounds for the critical probability of edge preservation under which a phase transition occurs, i.e., large new independent sets appear in the subgraph, which did not exist in the original graph.