Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. RAN. Math. Inf. Proc. Upr.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia, 2021, Volume 499, Pages 17–19
DOI: https://doi.org/10.31857/S268695432104007X (Mi danma184) 		 
This article is cited in 1 scientific paper (total in 1 paper)

MATHEMATICS

Asymptotics of the independence number of a random subgraph of the graph $G(n,r,<s)$

V. S. Karasa, P. A. Ogarokb, A. M. Raigorodskiiabcd

a Lomonosov Moscow State University, Moscow, Russia
b Moscow Institute of Physics and Technology (National Research University), Dolgoprudnyi, Moscow oblast, Russia
c Caucasus Mathematical Center, Adyghe State University, Maykop, Republic of Adygea, Russia
d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude, Buryat Republic, Russia
Full-text PDF (89 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S268695432104007X
Abstract: In this paper, we deal with a probabilistic version of a classical problem in extremal combinatorics. An extension to the case of nonconstant parameters and to the case of different probabilities of edges is established for a stability theorem asserting that the independence number of a random subgraph of a graph $G(n,r,<s)$ does not change asymptotically, provided that the initial edges are deleted independently.
Keywords: asymptotics, independence number, random subgraphs, graph $G(n,r,<s)$.
Funding agency Grant number
Russian Science Foundation 16-11-10014
This work was supported by the Russian Science Foundation, project no. 16-11-10014.
Presented: V. V. Kozlov
Received: 26.03.2020
Revised: 15.05.2021
Accepted: 16.05.2021
English version:
Doklady Mathematics, 2021, Volume 104, Issue 1, Pages 173–174
DOI: https://doi.org/10.1134/S1064562421040074
Bibliographic databases:
Document Type: Article
UDC: 519.1
Language: Russian
Citation: V. S. Karas, P. A. Ogarok, A. M. Raigorodskii, “Asymptotics of the independence number of a random subgraph of the graph $G(n,r,<s)$”, Dokl. RAN. Math. Inf. Proc. Upr., 499 (2021), 17–19; Dokl. Math., 104:1 (2021), 173–174
Citation in format AMSBIB
\Bibitem{KarOgaRai21}
\by V.~S.~Karas, P.~A.~Ogarok, A.~M.~Raigorodskii
\paper Asymptotics of the independence number of a random subgraph of the graph $G(n,r,<s)$
\jour Dokl. RAN. Math. Inf. Proc. Upr.
\yr 2021
\vol 499
\pages 17--19
\mathnet{http://mi.mathnet.ru/danma184}
\crossref{https://doi.org/10.31857/S268695432104007X}
\zmath{https://zbmath.org/?q=an:1478.05137}
\elib{https://elibrary.ru/item.asp?id=46532745}
\transl
\jour Dokl. Math.
\yr 2021
\vol 104
\issue 1
\pages 173--174
\crossref{https://doi.org/10.1134/S1064562421040074}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85118759477}
Linking options:
  • https://www.mathnet.ru/eng/danma184
  • https://www.mathnet.ru/eng/danma/v499/p17
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
    Statistics & downloads:
    Abstract page:95
    Full-text PDF :18
    References:10
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024