This article is available for purchase or by subscription. See below.
Abstract
|
The problem of finding a maximal dense subgraph of a power-law random graph
is considered for
every value of density
and for every
. It is
shown that in case
a maximal
-dense
subgraph has size
,
in case
it is limited
whp, and in case
it
is whp less than
.
|
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.82
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
power-law random graph, Poissonian model, maximal dense
subgraph, graph density, maximal dense subgraph of random
graph.
|
Mathematical Subject Classification 2010
Primary: 05C42
Secondary: 05C69
|
Milestones
Received: 27 December 2019
Revised: 21 July 2020
Accepted: 7 August 2020
Published: 16 January 2021
|
|