Random-graph theory is not for the faint of heart. As a result, there are not really any readings one might call “accessible.” Nevertheless, here are some important ones. The original results of Erdős and Rényi dealing with the evolution and connectedness of random graphs are contained in the following series of classic papers (none of which are easy to find in your average library): •• Erdős, P., and Rényi, A. On random graphs.

Mathematicae,

6, 290-297 (1959). •• Erdős, P., and Rényi, A. On the evolution of random graphs.

the Mathematical Institute of the Hungarian Academy of Sciences,

5, 17-61 (1960). •• Erdős, P., and Rényi, A. On the strength and connectedness of a random graph.

Acta Mathematica Scientia Hungary,

12, 261-267 (1961).

The standard textbook for the field of random graphs, and one that summarizes the most significant developments since Erdős and Rényi, is: ••

Bollobas, B. Random Graphs,

2d ed. (Academic, New York, 2001).

Unknown page