On random subgraphs of Kneser graphs and their generalizations


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

A series of results are obtained on the stability of the independence number of random subgraphs of distance graphs, which are natural generalizations of the classical Kneser graphs.

About the authors

M. M. Pyaderkin

Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty

Email: mraigor@yandex.ru
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991

A. M. Raigorodskii

Moscow Institute of Physics and Technology (State University); Mechanics and Mathematics Faculty; Institute of Mathematics and Computer Science

Author for correspondence.
Email: mraigor@yandex.ru
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119991; Ulan-Ude, Buryat Republic, 670000

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Pleiades Publishing, Ltd.