On the interval number of random graphs

Abstract Erdos and West [6] showed that for almost all graphs G (with edge probability 1 2 ), the interval number of G, denoted i(G), satisfies n⧸(4 lg n)⩽i(G)⩽(n + 1)⧸4. We improve their result by showing that for almost every graph, i(G)∼ 1 2 (n⧸lg n) .

[1]  Thomas Andreae.  On an extremal problem concerning the interval number of a graph , 1986, Discret. Appl. Math..

[2]  Jerrold R. Griggs.  Extremal values of the interval number of a graph, II , 1979, Discret. Math..

[3]  Paul Erdös,et al.  A note on the interval number of a graph , 1985, Discret. Math..

[4]  D. Freedman.  On Tail Probabilities for Martingales , 1975 .

[5]  Béla Bollobás,et al.  The chromatic number of random graphs , 1988, Comb..

[6]  Thomas Andreae.  On the unit interval number of a graph , 1988, Discret. Appl. Math..

[7]  Thomas Andreae.  On the Interval Number of a Triangulated Graph , 1987, J. Graph Theory.

[8]  Frank Harary,et al.  On double and multiple interval graphs , 1979, J. Graph Theory.

[9]  William T. Trotter,et al.  The interval number of a complete multipartite graph , 1984, Discret. Appl. Math..

[10]  Douglas B. West,et al.  The interval number of a planar graph: Three intervals suffice , 1983, J. Comb. Theory, Ser. B.

[11]  Edward R. Scheinerman.  Irrepresentability by multiple intersection, or why the interval number is unbounded , 1985, Discret. Math..

[12]  Edward R. Scheinerman.  Irredundancy in multiple interval representations , 1987, Discret. Math..

[13]  Kazuoki Azuma.  WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[14]  Christoph Maas.  Some results about the interval number of a graph , 1983, Discret. Appl. Math..

[15]  Douglas B. West,et al.  Extremal Values of the Interval Number of a Graph , 1980, SIAM J. Matrix Anal. Appl..

[16]  David B. Shmoys,et al.  Recognizing graphs with fixed interval number is NP-complete , 1984, Discret. Appl. Math..