On the size of a maximal induced tree in a random graph

Previous | Up | Next

Article

On the size of a maximal induced tree in a random graph. (English). Mathematica Slovaca, vol. 30 (1980), issue 2, pp. 151-155

MSC: 05C05, 05C99, 60C05 | MR 587240 | Zbl 0438.05028

References:

[1] BOLLOBÁS B., ERDÖS P.: Cliques in random graphs. Math. Proc. Cambridge Philos. Soc., 80, 1976, 419-427. MR 0498256 | Zbl 0344.05155

[2] MATULA D. W.: On the complete subgraphs of a random graph. Comb. Math, and Its Appl. Chapel Hill, N. C., 1970. MR 0266796 | Zbl 0209.28101

[3] MATULA D. W.: The largest clique size in a random graph. Technical Report CS 7608, 1976.

Partner of