Abstract
Let Rn be the centered and normalized number of copies of a fixed graph G contained in the Erdös–Rényi graph with n vertices. We obtain upper exponential inequalities for the tail probabilities of Rn, which are uniform in n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have