Email this article The Size of a Maximum Subgraph of the Random Graph with a Given Number of Edges
- Authors: Derevyanko N.M.1, Zhukovskii M.E.1,2,3, Rassias M.4, Skorkin A.Y.5
-
Affiliations:
- Moscow Institute of Physics and Technology (National Research University)
- Caucasus Mathematical Center
- Russian Presidential Academy of National Economy and Public Administration
- University of Zurich
- Adyghe State University
- Issue: Vol 100, No 2 (2019)
- Pages: 478-479
- Section: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/225725
- DOI: https://doi.org/10.1134/S1064562419050223
- ID: 225725
Cite item
Open Access
Access granted
Subscription Access
About the authors
N. M. Derevyanko
Moscow Institute of Physics and Technology (National Research University)
Email: zhukmax@gmail.com
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700
M. E. Zhukovskii
Moscow Institute of Physics and Technology (National Research University); Caucasus Mathematical Center; Russian Presidential Academy of National Economyand Public Administration
Author for correspondence.
Email: zhukmax@gmail.com
Russian Federation, Dolgoprudnyi, Moscow oblast, 141700; Maykop, Republic of Adygea, 385000; Moscow, 119571
M. Rassias
University of Zurich
Email: zhukmax@gmail.com
Switzerland, Zurich
A. Yu. Skorkin
Adyghe State University
Email: zhukmax@gmail.com
Russian Federation, Maykop, Republic of Adygea, 385000
Supplementary files
