S. V. Vakhrushev, M. E. Zhukovskii, S. G. Kiselev, A. Skorkin, “Minimum clique-free subgraphs of Kneser graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 2020, Volume 495,Pages <nobr>31–33</nobr>

RUS ENG

JOURNALS // Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia // Archive

Dokl. RAN. Math. Inf. Proc. Upr., 2020 Volume 495, Pages 31–33 (Mi danma130)

MATHEMATICS

Minimum clique-free subgraphs of Kneser graphs

S. V. Vakhrushev^a, M. E. Zhukovskii^abcd, S. G. Kiselev^a, A. Skorkin^c

^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

Abstract: The saturation and weak saturation numbers of Kneser graphs with clique patterns are estimated.

Keywords: Kneser graphs, saturation number, weak saturation number.

UDC: 519.157

Presented: V. V. Kozlov
Received: 06.07.2020
Revised: 06.07.2020
Accepted: 17.09.2020

DOI: 10.31857/S2686954320060181

English version: Doklady Mathematics, 2020, 102:3, 472–473

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024