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

Дәйексөз келтіру

Толық мәтін

Ашық рұқсат
Рұқсат жабық

Рұқсат берілді
Рұқсат жабық

Тек жазылушылар үшін

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