论文信息 - Random interval graphs

Random interval graphs

In this paper we introduce a notion ofrandom interval graphs: the intersection graphs of real, compact intervals whose end points are chosen at random. We establish results about the number of edges, degrees, Hamiltonicity, chromatic number and independence number of almost all interval graphs.

Edward R. Scheinerman | E. Scheinerman

[1] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .

[2] P. Billingsley,et al. Probability and Measure , 1980 .

[3] E. Palmer. Graphical evolution: an introduction to the theory of random graphs , 1985 .

[4] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[5] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .

[6] B. Bollobás. The evolution of random graphs , 1984 .

[7] Joel E. Cohen. The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph , 1982, Discret. Math..

[8] Lord Rayleigh F.R.S.. XII. On the resultant of a large number of vibrations of the same pitch and of arbitrary phase , 1880 .

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

[10] V. Chvátal. On Hamilton's ideals , 1972 .

[11] Paul Erd. A NOTE ON THE INTERVAL NUMBER OF A GRAPH , 1985 .

[12] Béla Bollobás,et al. Random Graphs , 1985 .