On the size of a maximal induced tree in a random graph
Michał Karoński; Zbigniew Palka
Mathematica Slovaca (1980)
- Volume: 30, Issue: 2, page 151-155
- ISSN: 0139-9918
Access Full Article
topHow to cite
topReferences
top- BOLLOBÁS B., ERDÖS P., Cliques in random graphs, Math. Proc. Cambridge Philos. Soc., 80, 1976, 419-427. (1976) Zbl0344.05155MR0498256
- MATULA D. W., On the complete subgraphs of a random graph, Comb. Math, and Its Appl. Chapel Hill, N. C., 1970. (1970) Zbl0209.28101MR0266796
- MATULA D. W., The largest clique size in a random graph, Technical Report CS 7608, 1976. (1976)