Counting the number of unavoidable sets of a given size in a finite set of integers (Q3377519)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting the number of unavoidable sets of a given size in a finite set of integers |
scientific article; zbMATH DE number 5014488
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting the number of unavoidable sets of a given size in a finite set of integers |
scientific article; zbMATH DE number 5014488 |
Statements
23 March 2006
0 references
avoidable sets
0 references
set partitions
0 references
0.7726258039474487
0 references
0.7718344926834106
0 references
0.7661676406860352
0 references
