MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Does anyone know of results/references related to large deviation bounds on the number of subforests (or the Tutte polynomial) in G(n,p) (Erdos-Renyi random graphs)?

share|cite|improve this question
I now know of results about the expectation and variance of the number of spanning trees in G(n,p) (…) and the expected number of forests in G(n,p). But still no results on large deviation bounds for the number of forests. – user14358 Apr 15 '11 at 23:37

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.