𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An asymptotic formula for the number of classes of sets of n indistinguishable elements

✍ Scribed by James F Lynch

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
130 KB
Volume
19
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Asymptotic Formula for the Number of
An Asymptotic Formula for the Number of Complete Propositional Connectives
✍ Roger F. Wheeler πŸ“‚ Article πŸ“… 1962 πŸ› John Wiley and Sons 🌐 English βš– 205 KB

The present article is really a continuation of the author's earlier paper [,l] on this subject. The line of investigation described previously is rounded off by deriving some further numcrical results, which include, in particular, an asymptotic fonnula for the number of complete propositional conn

An asymptotic formula for the number of
An asymptotic formula for the number of graphs having small diameter
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 351 KB

In this paper it is shown that for every fixed k 1> 3, G(n; d = k) = 2(~) (6.2 -k + o(1))", where G(n; d = k) denotes the number of graphs of order n and diameter equal to k. It is also proved that for every fixed k>~2, lim,~G(n;d=k)/G(n;d=k+ 1)=lim.o~G(n;d=n-k)/ G(n;d=n-k+ 1)= oo hold.