On the chromatic number of a random subgraph of the Kneser graph

Авторы: Kiselev S.¹, Raigorodskii A.¹^,2^,3
Учреждения:
1. Moscow Institute of Physics and Technology (State University)
2. Faculty of Mechanics and Mathematics
3. Institute of Mathematics and Informatics
Выпуск: Том 96, № 2 (2017)
Страницы: 475-476
Раздел: Mathematics
URL: https://journals.rcsi.science/1064-5624/article/view/225383
DOI: https://doi.org/10.1134/S1064562417050209
ID: 225383

Цитировать

Полный текст

Открытый доступ
Доступ закрыт

Доступ предоставлен
Доступ закрыт

Только для подписчиков

Results are obtained that substantially strengthen a previously known bound for the chromatic number of a random subgraph of the Kneser graph.

Moscow Institute of Physics and Technology (State University)

Автор, ответственный за переписку.
Email: kiselev.sg@gmail.com
Россия, Dolgoprudnyi, Moscow oblast, 141700

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

Email: kiselev.sg@gmail.com
Россия, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119992; Ulan-Ude, Buryat Republic, 670000