\indent a random $d$-regular graph is simply a graph, drawn uniformly at random, from the probability space of all $d$-regular graphs on $n$ vertices. researchers are interested in the properties of this graph that hold with probability approaching 1 as the number of vertices grows large. in this talk we discuss some of the main results in this area and the tools that are used for proving them. we also describe a new result about the chromatic number. this is joint work with xavier p\'{e}rez and nick wormald.