1 paper
Asaf Cohen Antonir, Matan Harel, Frank Mousset +1
Let Gn,p be the binomial random graph of density p and let XH be the number of copies of a fixed graph H in Gn,p. We prove asymptotically tight bounds on the logar…