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 .
"Dense subgraphs of power-law random graphs." Mosc. J. Comb. Number Theory 10 (1) 1 - 11, 2021. https://doi.org/10.2140/moscow.2021.10.1