Introduction

This chapter is devoted to random graphs. A number of ways of introducing randomness for various classes of graph exists, one of which is to specify on some classes of graph (trees, forests, graphs of one-to-one mappings and so on) certain, as a rule uniform, probability distributions. The second way of constructing random graphs is defined by a stochastic process which gives a rule for joining a number of initially isolated vertices by edges. The third way, which is closely related to the second, is described by a random procedure of deletion of edges from a complete graph. Other methods for constructing random graphs exist but they are of little use.

Before proceeding to describe results in the field, we list a number of statements concerning the combinatorial properties of graphs that will be required in the sequel. In this chapter we deal mainly with labeled graphs and for this reason the results cited below are related, as a rule, to such combinatorial structures.

Trees

Labeled trees are, in a sense, the simplest labeled graphs. A tree is a connected graph with no cycles. A rooted tree is a tree which has a distinguished vertex called the root.