Abstract
Let G_{\rm 3-out} denote the random graph on vertex set [n] in which each vertex chooses 3 neighbors uniformly at random. Note that G_{\rm 3-out} has minimum degree 3 and average degree 6. We prove that the probability that G_{\rm 3-out} is Hamiltonian goes to 1 as n tends to infinity.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.