The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain a copy of H with probability close to one?
['Jeong Han Kim', 'Benny Sudakov', 'Van H. Vu']
Note: Small subgraphs of random regular graphs