betaFeedback

WorksMathematics

On Threshold Probabilities for the Stability of the Independence Number of a Random Subgraph

Abstract

For an arbitrary sequence of graphs GnG_n, we consider a random spanning subgraph Gn,pG_{n,p} in which each edge of the graph GnG_n survives independently of the others with probability pp. We obtain a general upper bound for the independence number α(Gn,p)α(G_{n,p}), from which, for an arbitrary probability p=p(n)p=p(n), we derive sufficient conditions for asymptotic stability, i.e., for the equality α(Gn,p)=(1+o(1))α(Gn)α(G_{n,p})=(1+o(1))α(G_n) asymptotically almost surely, as well as upper bounds for the independence number of the random subgraph, including unconditional ones; for p=1/2p=1/2 they recover A. M. Raigorodskii's results of 2017 and 2026. Under additional conditions on the structure of the independent sets of the graph GnG_n, we find, up to a constant factor, the threshold probabilities for both asymptotic and exact stability (the equality α(Gn,p)=α(Gn)α(G_{n,p})=α(G_n)). Special cases include results on the graphs G(n,r,<s)G(n,r,<s) for growing rr and ss, including Kneser graphs for growing rr; we also give examples of complete multipartite graphs, graphs on the blocks of Steiner systems, and qq-analogues of Kneser graphs.

Paper details

vlnc:W_euxh9ybn
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…