Dense subgraphs of power-law random graphs
D.O. Lazarev, Nikolay N. Kuzyurin · Moscow Journal of Combinatorics and Number Theory · 2021
The problem of finding a maximal dense subgraph of a power-law random graph [math] is considered for every value of density [math] and for every [math] . It is shown that in case [math] a maximal [math] -dense subgraph has size [math] , in case [math] it is limited whp, and in case [math] it is whp less than [math] .