Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Koshelev, Mikhail
Birth date: 22.01.1999
Keywords: distance graphs, Johnson graphs, clique-chromatic numbers, modularity

Subject:

Properties of distance graphs
   
Main publications:
  1. Ipatov M.M., Koshelev M.M., Raigorodskii A.M., “Modulyarnost nekotorykh distantsionnykh grafov”, Doklady Rossiiskoi akademii nauk. Matematika, informatika, protsessy upravleniya, 490:1 (2020), 71-73
  2. Raigorodskii A.M., Koshelev M.M., “Novye otsenki kliko-khromaticheskikh chisel grafov Dzhonsona”, Doklady Rossiiskoi akademii nauk. Matematika, informatika, protsessy upravleniya, 490:1 (2020), 78-80
  3. A.M. Raigorodskii, M.M. Koshelev, “New bounds on clique-chromatic numbers of Johnson graphs”, Discrete and Applied Math., 283 (2020), 724-729  mathscinet

https://www.mathnet.ru/eng/person158505
List of publications on Google Scholar

Publications in Math-Net.Ru Citations
2025
1. M. M. Koshelev, D. A. Shabanov, T. M. Shaikheeva, “Threshold probabilities for colourings of random hypergraphs”, Uspekhi Mat. Nauk, 80:1(481) (2025),  161–162  mathnet  mathscinet; Russian Math. Surveys, 80:1 (2025), 150–152  isi  scopus
2021
2. N. M. Derevyanko, M. M. Koshelev, “New modularity bounds for graphs $G(n,r,s)$ and $G_p(n,r,s)$”, Probl. Peredachi Inf., 57:4 (2021),  87–109  mathnet; Problems Inform. Transmission, 57:4 (2021), 380–401  isi  scopus 2
2020
3. A. M. Raigorodskii, M. Koshelev, “New bounds for the clique-chromatic numbers of Johnson graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 490 (2020),  78–80  mathnet  zmath  elib; Dokl. Math., 101:1 (2020), 66–67 10
4. M. M. Ipatov, M. Koshelev, A. M. Raigorodskii, “Modularity of some distance graphs”, Dokl. RAN. Math. Inf. Proc. Upr., 490 (2020),  71–73  mathnet  zmath  elib; Dokl. Math., 101:1 (2020), 60–61 9

Organisations