Previous |  Up |  Next

Article

Title: On the size of a maximal induced tree in a random graph (English)
Author: Karoński, Michał
Author: Palka, Zbigniew
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 30
Issue: 2
Year: 1980
Pages: 151-155
.
Category: math
.
MSC: 05C05
MSC: 05C99
MSC: 60C05
idZBL: Zbl 0438.05028
idMR: MR587240
.
Date available: 2009-09-25T09:06:40Z
Last updated: 2012-07-31
Stable URL: http://hdl.handle.net/10338.dmlcz/130499
.
Related article: http://dml.cz/handle/10338.dmlcz/131750
.
Reference: [1] BOLLOBÁS B., ERDÖS P.: Cliques in random graphs.Math. Proc. Cambridge Philos. Soc., 80, 1976, 419-427. Zbl 0344.05155, MR 0498256
Reference: [2] MATULA D. W.: On the complete subgraphs of a random graph.Comb. Math, and Its Appl. Chapel Hill, N. C., 1970. Zbl 0209.28101, MR 0266796
Reference: [3] MATULA D. W.: The largest clique size in a random graph.Technical Report CS 7608, 1976.
.

Files

Files Size Format View
MathSlov_30-1980-2_7.pdf 375.9Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo