Erd\H{o}-R\’{e}nyi random graphs with constant average degree are interesting due to their similarity to real-world networks. Unfortunately, because they are very sparse, many classical tools that were developed for denser graphs stop working. Consequently, despite the recent progress in understanding large deviation properties of non-linear observables of random graphs, most questions in this...