Regular trees in random regular graphs
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/2 n, where n is the number of vertices in the graph. And we give an asymptotic estimate for Gauss' Hypergeometric Function.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.