Let P be a family of simple polygons in the plane. If every three (not necessarily distinct) members of P have a simply connected union and every two members of P have a nonempty intersection, then N{P:P in P) Β’ Β’. Applying the result to a finite family C of orthogonally convex polygons, the set fq{
A helly type theorem for hypersurfaces
β Scribed by M Deza; P Frankl
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 177 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Suppose that G ifn a graph. A l-factor is a set of edges of G such that every vertex of G meets exactly one of its edges. Suppose that we have a set Y of l-factors of G such that any two l-factors vf Y have an edge in common. We investigate the following questions: (1) How large may Y be? (2) When
The d-convex sets in a metric space are those subsets which include the metric interval between any two of its elements. Weak modularity is a certain interval property for triples of points. The d-convexity of a discrete weakly modular space X coincides with the geodesic convexity of the graph forme
A (finite or infinite) graph G is strongly dismantlable if its vertices can be linearly ordered x o ..... x~ so that, for each ordinal fl < ~, there exists a strictly increasing finite sequence (i~)0~<j~<n of ordinals such that i o = fl, i, = ct and xi~ +1 is adjacent with x~j and with all neighbors