A note on the width of sparse random graphs

Abstract

AbstractIn this note, we consider the width of a supercritical random graph according to some commonly studied width measures. We give short, direct proofs of results of Lee, Lee and Oum, and of Perarnau and Serra, on the rank‐ and tree‐width of the random graph when for constant. Our proofs avoid the use of black box results on the expansion properties of the giant component in this regime, and so as a further benefit we obtain explicit bounds on the dependence of these results on . Finally, we also consider the width of the random graph in the weakly supercritical regime, where and . In this regime, we determine, up to a constant multiplicative factor, the rank‐ and tree‐width of as a function of and .