Regular trees in random regular graphs

MaRDI QIDQ6478123zbMATH OpenFDO

Authors Eran Makover, Jeffrey McGowan

Publication date 27 October 2006

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Abstract: 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/2logn$, where $n$ is the number of vertices in the graph. And we give an asymptotic estimate for Gauss' Hypergeometric Function.

This page was built for publication: Regular trees in random regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478123)