Regular trees in random regular graphs

Details Regular trees in random regular graphs Regular trees in random regular graphs

2006-10-27

arxiv.org/abs/math/0610858v2

Mathematics

Combinatorics

Scientific paper

We investigate the size of the embedded regular tree rooted at a vertex in a
$d$ regular random graph. We show that almost always, the radius of this tree
will be ${1/2}\log n$, where $n$ is the number of vertices in the graph. And we
give an asymptotic estimate for Gauss' Hypergeometric Function.

Affiliated with

Also associated with

No associations

Rating

Regular trees in random regular graphs 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 Regular trees in random regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regular trees in random regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169755