Helly family

In combinatorics, a Helly family of order k is a family of sets such that any minimal subfamily with an empty intersection has k or fewer sets in it. In other words, any subfamily such that every $k$ -fold intersection is non-empty has non-empty total intersection.

The k-Helly property is the property of being a Helly family of order k. These concepts are named after Eduard Helly (1884 - 1943); Helly's theorem on convex sets, which gave rise to this notion, states that convex sets in Euclidean space of dimension n are a Helly family of order n + 1.

Examples

In the family of all subsets of the set {a,b,c,d}, the subfamily {{a,b,c}, {a,b,d}, {a,c,d}, {b,c,d}} has an empty intersection, but removing any set from this subfamily causes it to have a nonempty intersection. Therefore, it is a minimal subfamily with an empty intersection. It has four sets in it, and is the largest possible minimal subfamily with an empty intersection, so the family of all subsets of the set {a,b,c,d} is a Helly family of order 4.

Let I be a set of closed intervals of the real line with an empty intersection. Then there must be two intervals A and B in I such that the left endpoint of A is larger than the right endpoint of B.^[why?] {A,B} have an empty intersection, so I cannot be minimal unless I={A,B}. Therefore, all minimal families of intervals with empty intersections have 2 or fewer intervals in them, and the set of all intervals is a Helly family of order 2.

Formal definition

More formally, a Helly family of order k is a set system (F, E), with F a collection of subsets of E, such that, for any G ⊆ F with

\bigcap _{X\in G}X=\varnothing ,

we can find H ⊆ G such that

\bigcap _{X\in H}X=\varnothing

and

\left|H\right|\leq k.

Helly dimension

If a family of sets is a Helly family of order k, that family is said to have Helly number k. The Helly dimension of a metric space is one less than the Helly number of the family of metric balls in that space; Helly's theorem implies that the Helly dimension of a Euclidean space equals its dimension as a real vector space.

The Helly dimension of a subset S of a Euclidean space, such as a polyhedron, is one less than the Helly number of the family of translates of S. For instance, the Helly dimension of any hypercube is 1, even though such a shape may belong to a Euclidean space of much higher dimension.

Helly dimension has also been applied to other mathematical objects. For instance M. Domokos (arXiv:math.AG/0511300) defines the Helly dimension of a group (an algebraic structure formed by an invertible and associative binary operation) to be one less than the Helly number of the family of left cosets of the group.

The Helly property

If a family of nonempty sets has an empty intersection, its Helly number must be at least two, so the smallest k for which the k-Helly property is nontrivial is k = 2. The 2-Helly property is also known as the Helly property. A 2-Helly family is also known as a Helly family.

A convex metric space in which the closed balls have the 2-Helly property (that is, a space with Helly dimension 1) is called injective or hyperconvex. The existence of the tight span allows any metric space to be embedded isometrically into a space with Helly dimension 1.

References

Balakrishnan, R. (2000). A textbook of graph theory. New York: Springer. ISBN 0-387-98859-9 (acid-free paper). {{cite book}}: Check |isbn= value: invalid character (help); Unknown parameter |coauthors= ignored (|author= suggested) (help)

Kloks, Ton (1994). Treewidth: computations and approximations. Berlin; New York: Springer-Verlag. ISBN 3-540-58356-4.