Abstract

We prove the existence of a large complete subgraph w.h.p. in a preferential attachment random graph process with an edge-step. That is, we prove that the random graph Gt produced by the so-called GLP model at time t contains a complete subgraph of order tα, where α=(1−ε)1−p2−p, ε is any number such that 0<ε<1, and 0<p<1 is a parameter of the model.