On the interval number of random graphs
The interval number of a graph G is defined as the smallest integer t such that G is an intersection graph of sets each of which is the union of t real intervals. The interval number is shown to be asymptotically equal to (n log 2)/(2 log n) for almost every graph.
scientific article; zbMATH DE number 4170954