Abstract
The notion of -agreeable society was introduced by Deborah Berg et al.: a family of convex subsets of is called -agreeable if any subfamily of size contains at least one non-empty -fold intersection. In that paper, the -agreeability of a convex family was shown to imply the existence of a subfamily of size with non-empty intersection, where is the size of the original family and is an explicit constant depending only on and . The quantity is called the minimal \emph{agreement proportion} for a -agreeable family in . If we only assume that the sets are convex, simple examples show that for -agreeable families in where . In this paper, we introduce new techniques to find positive lower bounds when restricting our attention to families of -boxes, i.e. cuboids with sides parallel to the coordinates hyperplanes. We derive explicit formulas for the first non-trivial case: the case of -agreeable families of -boxes with .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.