Tomasz uczak
Abstract
In the paper we study the asymptotic behavior of the number of trees with n vertices and diameter k=k(n), where (n−k)/n→a as n→∞ for some constant a<1. We use this result to determine the limit distribution of the diameter of the random graph G(n, p) in the subcritical phase. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 13: 485–500, 1998
OpenAlex reports 50 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In the paper we study the asymptotic behavior of the number of trees with n vertices and diameter k=k(n), where (n−k)/n→a as n→∞ for some constant a<1. We use this result to determine the limit distribution of the diameter of the random graph G(n, p) in the subcritical phase. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 13: 485–500, 1998
Key concepts: struct, Random graph, Combinatorics, Mathematics, Random regular graph, Limit (mathematics), Random tree, Discrete mathematics