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

Authors: Kiselev S.G.¹, Raigorodskii A.M.¹^,2^,3
Affiliations:
1. Moscow Institute of Physics and Technology (State University)
2. Faculty of Mechanics and Mathematics
3. Institute of Mathematics and Informatics
Issue: Vol 96, No 2 (2017)
Pages: 475-476
Section: Mathematics
URL: https://journals.rcsi.science/1064-5624/article/view/225383
DOI: https://doi.org/10.1134/S1064562417050209
ID: 225383

Cite item

Full Text

Open Access
Restricted Access

Access granted
Restricted Access

Subscription Access

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)

Author for correspondence.
Email: kiselev.sg@gmail.com
Russian Federation, 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
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700; Moscow, 119992; Ulan-Ude, Buryat Republic, 670000