Independence numbers of random subgraphs of Johnson graphs

In this paper, we consider generalized Johnson graphs G(n, r, s) and their random subgraphs Gp(n, r, s). The main topic of the study is asymptotic estimates of the independence number (maximal independent set) in such random subgraphs. A theorem on asymptotic estimation from below of the independence number of a Johnson random graph is formulated and proved.