𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Size of largest and second largest cluster in random percolation

✍ Scribed by A. Margolina; H.J. Herrmann; D. Stauffer

Book ID
107986163
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
258 KB
Volume
93
Category
Article
ISSN
0375-9601

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The size of the largest hole in a random
The size of the largest hole in a random graph
✍ Tomasz Łuczak πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 775 KB

Let H(n, p) denote the size of the largest induced cycle in a random graph C(n, p). It is shown that if the expected average degree of G(n, p) is a constant larger than 1, then H(n, p) is of the order n with probability 1 -o(l). Moreover, for C(n, p) with large average degree, H(n, p) is determined

The largest tree in certain models of ra
The largest tree in certain models of random forests
✍ Ljuben Mutafchiev πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 227 KB πŸ‘ 2 views

We consider four families of forests on n vertices: labeled and unlabeled forests containing rooted and unrooted trees, respectively. A forest is chosen uniformly from one of the given four families. The limiting distribution of the size of its largest tree is then studied as n Βͺ Ο±. Convergences to

An upper bound on the size of the larges
An upper bound on the size of the largest cliques in a graph
✍ Alain Billionnet πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 194 KB πŸ‘ 1 views

## Abstract We produce in this paper an upper bound for the number of vertices existing in a clique of maximum cardinal. The proof is based in particular on the existence of a maximum cardinal clique that contains no vertex __x__ such that the neighborhood of __x__ is contained in the neighborhood

An upper bound on the size of a largest
An upper bound on the size of a largest clique in a graph
✍ Dennis P. Geoffroy; David P. Sumner πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, Ο‰(__G__), of a maximum clique in __G__ sat