Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskie Zametki, 2022, Volume 111, Issue 1, Pages 107–116
DOI: https://doi.org/10.4213/mzm12722 (Mi mzm12722) 		 
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
Full-text PDF (509 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm12722
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.
Funding agency Grant number
Russian Science Foundation 16-11-10014
This work was supported by the Russian Science Foundation under grant 16-11-10014.
Received: 12.12.2020
English version:
Mathematical Notes, 2022, Volume 111, Issue 1, Pages 124–131
DOI: https://doi.org/10.1134/S0001434622010138
Bibliographic databases:
Document Type: Article
UDC: 519
Language: Russian
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
Citation in format AMSBIB
\Bibitem{RaiKar22}
\by A.~M.~Raigorodskii, V.~S.~Karas
\paper Asymptotics of the Independence Number of a Random Subgraph of the Graph~$G(n,r,<s)$
\jour Mat. Zametki
\yr 2022
\vol 111
\issue 1
\pages 107--116
\mathnet{http://mi.mathnet.ru/mzm12722}
\crossref{https://doi.org/10.4213/mzm12722}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4360087}
\transl
\jour Math. Notes
\yr 2022
\vol 111
\issue 1
\pages 124--131
\crossref{https://doi.org/10.1134/S0001434622010138}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000760397500013}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85119617889}
Linking options:
  • https://www.mathnet.ru/eng/mzm12722
  • https://doi.org/10.4213/mzm12722
  • https://www.mathnet.ru/eng/mzm/v111/i1/p107
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:254
    Full-text PDF :48
    References:54
    First page:17
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024