Sciweavers

17 search results - page 1 / 4
» On the average size of sets in intersecting Sperner families
Sort
View
DM
2002
90views more  DM 2002»
13 years 4 months ago
On the average size of sets in intersecting Sperner families
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
Christian Bey, Konrad Engel, Gyula O. H. Katona, U...
JCT
2010
65views more  JCT 2010»
13 years 3 months ago
Multiple cross-intersecting families of signed sets
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...
Peter Borg, Imre Leader
CORR
2011
Springer
162views Education» more  CORR 2011»
12 years 11 months ago
Helly numbers of acyclic families
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...
Éric Colin de Verdière, Grégo...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 4 months ago
Maximal Intersection Queries in Randomized Input Models
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...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
CSR
2007
Springer
13 years 11 months ago
Maximal Intersection Queries in Randomized Graph Models
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...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka