Consider the inhomogeneous Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices for which each pair $i,j\in\{1,\ldots,n\}$, $i\neq j$ is connected independently by an edge with probability $r_n(\frac{i-1}{n},\frac{j-1}{n})$, where $(r_n)_{n\in\mathbb{N}}$ a sequence of graphons converging to reference graphon $r$. As generalization celebrated LDP ERRGs Chatterjee and Varadhan (2010), Dhara Sen...