𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the asymptotic behavior of the independence number of a random (n, n)-tree

✍ Scribed by J. H. Cho; E. M. Palmer

Publisher
Springer Japan
Year
1996
Tongue
English
Weight
416 KB
Volume
12
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the independence number of random gra
On the independence number of random graphs
✍ A.M. Frieze πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 239 KB

Let (Y(G~,~) denote the independence number of the random graph Gn,p. Let d = np. We show that if E > 0 is fixed then with probability going to 1 as n + m cu(G& -$t (log d -log log dlog 2 + 1) < 7 provided d, s d = o(n), where d, is some fixed constant.