|
This article is cited in 2 scientific papers (total in 2 papers)
Asymptotics of the Independence Number of a Random Subgraph of the Graph $G(n,r,<s)$
A. M. Raigorodskiiabcd, V. S. Karasb a Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
b Lomonosov Moscow State University
c Caucasus Mathematical Center, Adyghe State University, Maikop
d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude
Abstract:
The probabilistic version of a classical problem of extremal combinatorics is considered. The stability theorem which says that the independence number of a random subgraph of the graph $G(n,r,s)$ remains asymptotically constant when edges are randomly removed is generalized to the case of nonconstant parameters.
Keywords:
graph $G(n,r,s)$, independence number, random subgraph, $s$-intersecting set, asymptotics.
Received: 12.12.2020
Citation:
A. M. Raigorodskii, V. S. Karas, “Asymptotics of the Independence Number of a Random Subgraph of the Graph $G(n,r,<s)$”, Mat. Zametki, 111:1 (2022), 107–116; Math. Notes, 111:1 (2022), 124–131
Linking options:
https://www.mathnet.ru/eng/mzm12722https://doi.org/10.4213/mzm12722 https://www.mathnet.ru/eng/mzm/v111/i1/p107
|
Statistics & downloads: |
Abstract page: | 256 | Full-text PDF : | 50 | References: | 56 | First page: | 17 |
|