Mikhail M. Koshelev

From MaRDI portal
(Redirected from Mikhail M. Koshelev)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Stability of the independence number of G(n,r,1) graphs
Discrete Mathematics
2026-08-13Paper
Spectrum of Johnson graphs
(available as arXiv preprint)
2026-01-01Paper
Modularity in planted partition model
(available as arXiv preprint)
2026-01-01Paper
Probability threshold for the stability of α(G(n,r,s))
(available as arXiv preprint)
2026-01-01Paper
List chromatic number of G(n,r,s) graphs
(available as arXiv preprint)
2026-01-01Paper
Ordinary and measurable colorings of Euclidean three-space
(available as arXiv preprint)
2026-01-01Paper
A polynomial method over formal power series
(available as arXiv preprint)
2026-01-01Paper
Threshold probabilities for colourings of random hypergraphs
Russian Mathematical Surveys
2025-05-12Paper
Spectral gap of G(n, αn, α^2 n) graphs and the giant component theorem
(available as arXiv preprint)
2025-01-01Paper
Stability of the independence number of G(n, r, 1) graphs
(available as arXiv preprint)
2025-01-01Paper
New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs2024-09-13Paper
Modularity of some distance graphs
European Journal of Combinatorics
2024-01-23Paper
Modularity in planted partition model
Computational Management Science
2023-08-22Paper
Spectrum of Johnson graphs
Discrete Mathematics
2023-01-17Paper
New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
Problems of Information Transmission
2022-01-20Paper
Modularity of some distance graphs
Doklady Mathematics
2021-11-11Paper
New bounds for the clique-chromatic numbers of Johnson graphs
Doklady Mathematics
2021-11-11Paper
Lower bounds on the clique-chromatic numbers of some distance graphs
Moscow Journal of Combinatorics and Number Theory
2021-08-03Paper
New lower bound on the modularity of Johnson graphs
Moscow Journal of Combinatorics and Number Theory
2021-02-23Paper
New bounds on clique-chromatic numbers of Johnson graphs
Discrete Applied Mathematics
2020-06-29Paper


Research outcomes over time


This page was built for person: Mikhail M. Koshelev