Regular trees in random regular graphs
Eran Makover, Jeffrey McGowan
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.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.