WorksMathematics
On Threshold Probabilities for the Stability of the Independence Number of a Random Subgraph
Abstract
For an arbitrary sequence of graphs , we consider a random spanning subgraph in which each edge of the graph survives independently of the others with probability . We obtain a general upper bound for the independence number , from which, for an arbitrary probability , we derive sufficient conditions for asymptotic stability, i.e., for the equality asymptotically almost surely, as well as upper bounds for the independence number of the random subgraph, including unconditional ones; for they recover A. M. Raigorodskii's results of 2017 and 2026. Under additional conditions on the structure of the independent sets of the graph , we find, up to a constant factor, the threshold probabilities for both asymptotic and exact stability (the equality ). Special cases include results on the graphs for growing and , including Kneser graphs for growing ; we also give examples of complete multipartite graphs, graphs on the blocks of Steiner systems, and -analogues of Kneser graphs.