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

作者: Kiselev S.G.¹, Raigorodskii A.M.¹^,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

如何引用文章

全文:

开放存取

##reader.subscriptionAccessGranted##
受限制的访问

订阅存取

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

附件文件

动作

1. JATS XML