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, 2020, Volume 495, Pages 31–33
DOI: https://doi.org/10.31857/S2686954320060181 (Mi danma130) 		 
MATHEMATICS

Minimum clique-free subgraphs of Kneser graphs

S. V. Vakhrusheva, M. E. Zhukovskiiabcd, S. G. Kiseleva, A. Skorkinc

a Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region, Russian Federation
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Omsk, Russian Federation
c Caucasus Mathematical Center, Adyghe State University, Maykop, Russian Federation
d The Russian Presidental Academy of National Economics and Public Administration, Moscow, Russian Federation
Full-text PDF (107 kB)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S2686954320060181
Abstract: The saturation and weak saturation numbers of Kneser graphs with clique patterns are estimated.
Keywords: Kneser graphs, saturation number, weak saturation number.
Funding agency Grant number
Mathematical Center in Akademgorodok 075-15-2019-1613
This work was supported by the Mathematical Center in Akademgorodok, contract no. 075-15-2019-1613 with the Ministry of Science and Higher Education of the Russian Federation.
Presented: V. V. Kozlov
Received: 06.07.2020
Revised: 06.07.2020
Accepted: 17.09.2020
English version:
Doklady Mathematics, 2020, Volume 102, Issue 3, Pages 472–473
DOI: https://doi.org/10.1134/S1064562420060204
Bibliographic databases:
Document Type: Article
UDC: 519.157
Language: Russian
Citation: S. V. Vakhrushev, M. E. Zhukovskii, S. G. Kiselev, A. Skorkin, “Minimum clique-free subgraphs of Kneser graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 495 (2020), 31–33; Dokl. Math., 102:3 (2020), 472–473
Citation in format AMSBIB
\Bibitem{VakZhuKis20}
\by S.~V.~Vakhrushev, M.~E.~Zhukovskii, S.~G.~Kiselev, A.~Skorkin
\paper Minimum clique-free subgraphs of Kneser graphs
\jour Dokl. RAN. Math. Inf. Proc. Upr.
\yr 2020
\vol 495
\pages 31--33
\mathnet{http://mi.mathnet.ru/danma130}
\crossref{https://doi.org/10.31857/S2686954320060181}
\zmath{https://zbmath.org/?q=an:1477.05126}
\elib{https://elibrary.ru/item.asp?id=44367197}
\transl
\jour Dokl. Math.
\yr 2020
\vol 102
\issue 3
\pages 472--473
\crossref{https://doi.org/10.1134/S1064562420060204}
Linking options:
  • https://www.mathnet.ru/eng/danma130
  • https://www.mathnet.ru/eng/danma/v495/p31
    • 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
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024