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


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

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.

Sobre autores

N. Derevyanko

Moscow Institute of Physics and Technology (National Research University)

Email: zhukmax@gmail.com
Rússia, 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

Autor responsável pela correspondência
Email: zhukmax@gmail.com
Rússia, Dolgoprudnyi, Moscow oblast, 141700; Maykop, Republic of Adygea, 385000; Moscow, 119571

M. Rassias

University of Zurich

Email: zhukmax@gmail.com
Suíça, Zurich

A. Skorkin

Adyghe State University

Email: zhukmax@gmail.com
Rússia, Maykop, Republic of Adygea, 385000

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2019