An evolution of interval graphs (Q912869)

A random interval is defined as \([x-e,x+e]\) with x chosen uniformly in [0,1] and e chosen uniformly in [0,r] where r is a parameter. The interval graph of n such intervals has n points, any pair of which is connected if the two interval overlap. The evolution of an interval graph gives an idea of how the expected properties of the graph change with increasing r. Among properties studied are the degree and chromatic number of the graph; the connecting and number of components. The history of these changes with increasing r is similar to that of random graphs as studied by Erdős and Renyi.