Estimation of the number of connected sets in a graph and the structure of components of random subsets (Q1594350)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1557657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimation of the number of connected sets in a graph and the structure of components of random subsets |
scientific article; zbMATH DE number 1557657 |
Statements
Estimation of the number of connected sets in a graph and the structure of components of random subsets (English)
0 references
28 January 2001
0 references
random subsets
0 references
enumeration problems
0 references
Boolean functions
0 references
inequalities
0 references
0.8191741704940796
0 references
0.754901111125946
0 references
0.749828577041626
0 references
