The maximum degree in a random tree and related problems. (English) Zbl 0797.60015
It is known that the distribution of the maximum degree of a random labelled tree on \(n\) vertices is concentrated on an interval of width three as \(n\to\infty\). The aim of this paper is to sharpen this result narrowing the interval to two. The authors also obtain rather explicit expressions for the non-negligible distribution probabilities.
Reviewer: L.Mutafchiev (Sofia)
Keywords:
distribution of the maximum degree of a random labelled tree; non- negligible distribution probabilitiesReferences:
| [1] | D’Aristotile, Sankhya Ser. A 50 pp 363– (1988) |
| [2] | Kolchin, Theory Probab. Appl. (USSR) pp 458– (1968) |
| [3] | Random Allocations, Halsted Press, 1978. |
| [4] | Random Mappings, Springer Verlag, New York, 1986. |
| [5] | and , Uniform Distribution of Sequences, Wiley, New York, 1974. · Zbl 0281.10001 |
| [6] | and , On nodes of given out-degree in random trees, Proc. 4th Czech. Symp. Comb. · Zbl 0779.05051 |
| [7] | Meir, Australas. J. Comb. 2 pp 147– (1990) |
| [8] | Meir, Congr. Numer. 82 pp 3– (1991) |
| [9] | Moon, Mich. Math. J. 15 pp 429– (1968) |
| [10] | Moon, Can. Math. Monogr. 1 (1970) |
| [11] | Szegö, Sitzungsber. Berlin Math. Gesellschaftswiss. 23 pp 50– (1924) |
| [12] | Topics in Rational and Interpolation and Approximation, Les Presses de l’Université de Montreal, Montreal, Canada, 1982. |
| [13] | Viktorova, Mat Zametki 1 pp 331– (1967) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
