Regular trees in random regular graphs
Combinatorics
2010-08-10 v2
Abstract
We investigate the size of the embedded regular tree rooted at a vertex in a regular random graph. We show that almost always, the radius of this tree will be , where is the number of vertices in the graph. And we give an asymptotic estimate for Gauss' Hypergeometric Function.
Keywords
Cite
@article{arxiv.math/0610858,
title = {Regular trees in random regular graphs},
author = {Eran Makover and Jeffrey McGowan},
journal= {arXiv preprint arXiv:math/0610858},
year = {2010}
}