17 search results - page 1 / 4 » On the average size of sets in intersecting Sperner families |
75
Voted
DM
2002
14 years 10 months ago
2002
We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than (n-1 k-1 ) is at least k provided that k 6 n=2
81
Voted
JCT
2010
14 years 8 months ago
2010
A k-signed r-set on [n] = {1, ..., n} is an ordered pair (A, f), where A is an rsubset of [n] and f is a function from A to [k]. Families A1, ..., Ap are said to be cross-intersec...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
79
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
66
Voted
CSR
2007
Springer
15 years 4 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...