Email this article On the chromatic number of a random subgraph of the Kneser graph
- Authors: Kiselev S.G.1, Raigorodskii A.M.1,2,3
-
Affiliations:
- Moscow Institute of Physics and Technology (State University)
- Faculty of Mechanics and Mathematics
- 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
Open Access
Access granted
Subscription Access
Abstract
Results are obtained that substantially strengthen a previously known bound for the chromatic number of a random subgraph of the Kneser graph.
About the authors
S. G. Kiselev
Moscow Institute of Physics and Technology (State University)
Author for correspondence.
Email: kiselev.sg@gmail.com
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700
A. M. Raigorodskii
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
Supplementary files
