|
|||||
|
|
The Size of a Maximum Subgraph of the Random Graph with a Given Number of Edges |
|
| Authors: | Derevyanko N. M. Zhukovskii M. E. Rassias M. Skorkin A. Yu. |
| Affiliation: | 1.Moscow Institute of Physics and Technology (National Research University), 141700, Dolgoprudnyi, Moscow oblast, Russia ;2.Caucasus Mathematical Center, 385000, Maykop, Republic of Adygea, Russia ;3.Russian Presidential Academy of National Economyand Public Administration, 119571, Moscow, Russia ;4.University of Zurich, Zurich, Switzerland ;5.Adyghe State University, 385000, Maykop, Republic of Adygea, Russia ; |
| Abstract: | Doklady Mathematics - We have proven that the maximum size k of an induced subgraph of the binomial random graph $$G(n,p)$$ with a given number of edges $$e(k)$$ (under certain conditions on this... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |