The Size of a Maximum Subgraph of the Random Graph with a Given Number of Edges


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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 function), with asymptotic probability 1, has at most two values.

作者简介

N. Derevyanko

Moscow Institute of Physics and Technology (National Research University)

Email: zhukmax@gmail.com
俄罗斯联邦, Dolgoprudnyi, Moscow oblast, 141700

M. Zhukovskii

Moscow Institute of Physics and Technology (National Research University); Caucasus Mathematical Center; Russian Presidential Academy of National Economy
and Public Administration

编辑信件的主要联系方式.
Email: zhukmax@gmail.com
俄罗斯联邦, Dolgoprudnyi, Moscow oblast, 141700; Maykop, Republic of Adygea, 385000; Moscow, 119571

M. Rassias

University of Zurich

Email: zhukmax@gmail.com
瑞士, Zurich

A. Skorkin

Adyghe State University

Email: zhukmax@gmail.com
俄罗斯联邦, Maykop, Republic of Adygea, 385000

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2019