๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Relative sizes of the largest bodies during the accumulation of planets

โœ Scribed by V.S. Safronov; E.V. Zvjagina

Publisher
Elsevier Science
Year
1969
Tongue
English
Weight
616 KB
Volume
10
Category
Article
ISSN
0019-1035

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Size of the Largest Antichain in the
The Size of the Largest Antichain in the Partition Lattice
โœ E.Rodney Canfield ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

Consider the poset 6 n of partitions of an n-element set, ordered by refinement. The sizes of the various ranks within this poset are the Stirling numbers of the second kind. Let a= 1 2 &e log(2)ร‚4. We prove the following upper bound for the ratio of the size of the largest antichain to the size of

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

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