Random regular graph

A random r-regular graph is a graph selected from , which denotes the probability space of all r-regular graphs on n vertices, where 3 ≤ r < n and… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The family of random regular graphs is a classic topic in the realms of graph theory, combinatorics and computer science. In this… (More)
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give… (More)
Is this relevant?
2009
2009
We show that there is a constant c so that for fixed r ≥ 3 a.a.s. an r-regular graph on n vertices contains a complete graph on c… (More)
Is this relevant?
Review
2008
Review
2008
This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of… (More)
Is this relevant?
2007
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The k-parameter bootstrap percolation on a graph is a model of an interacting particle system, which can also be viewed as a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Random d-regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Received We present a practical algorithm for generating random regular graphs. For all d growing as a small power of n, the d… (More)
Is this relevant?
1990
1990
An easy count ing argument shows here that la(G)>f . f f t " d i f f icu l ty is in establishing the upper bound. This problem… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
We give asymptotic upper and lower bounds for the diameter of almost every r-regular graph on n vertices (n~). Though random… (More)
Is this relevant?