The probability that a random multigraph is simple

Details The probability that a random multigraph is simple The probability that a random multigraph is simple

2006-09-28

arxiv.org/abs/math/0609802v1

Mathematics

Combinatorics

24 pages

Scientific paper

Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d_1+...+d_n)/2 tending to infinity, the probability that the multigraph is simple stays away from 0 if and only if \sum d_i^2=O(\sum d_i). This was previously known only under extra assumtions on the maximum degree. We also give an asymptotic formula for this probability, extending previous results by several authors.

Affiliated with

Also associated with

No associations

Rating

The probability that a random multigraph is simple does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The probability that a random multigraph is simple, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The probability that a random multigraph is simple will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532309