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 subsets of an arbitrary locally arc-wise connected topological space Γ. Assume that for every sub-family G ⊆ F the intersection of the elements of G has at most r connected components, each of which is a Q-homology cell. We show that the Helly number of F is at most r(dΓ + 1), where dΓ is the smallest integer j such that every open set of Γ has trivial Q-homology in dimension j and higher. (In particular dRd = d.) This bound is best possible. We also prove a stronger theorem where small sub-families may have more than r connected components, each possibly with nontrivial homology in low dimension. As an application, we obtain several explicit bounds on Helly numbers in geometric transversal theory for which only ad hoc geometric proofs were previously known; in certain cases, the bound we obtain is better than what was previously known. In fact, our proof bounds the Leray number of the nerves of the families under consideration and thus also yields, under similar assumptions, a fractional Helly theorem, a (p, q)-theorem and the existence of small weak -nets.
منابع مشابه
A Note on Smaller Fractional Helly Numbers
Let F be a family of geometric objects in R such that the complexity (number of faces of all dimensions on the boundary) of the union of any m of them is o(m). We show that F , as well as {F ∩P | F ∈ F} for any given set P ∈ R, have fractional Helly number at most k. This improves the known bounds for fractional Helly numbers of many families.
متن کاملOn Hereditary Helly Classes of Graphs
In graph theory, the Helly property has been applied to families of sets, such as cliques, disks, bicliques, and neighbourhoods, leading to the classes of clique-Helly, disk-Helly, biclique-Helly, neighbourhood-Helly graphs, respectively. A natural question is to determine for which graphs the corresponding Helly property holds, for every induced subgraph. This leads to the corresponding classe...
متن کاملBounding Helly Numbers via Betti Numbers
We show that very weak topological assumptions are enough to ensure the existence of a Hellytype theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b, d) such that the following holds. If F is a finite family of subsets of R such that β̃i ( ⋂G) ≤ b for any G ( F and every 0 ≤ i ≤ dd/2e−1 then F has Helly number at most h(b, d). Here β̃i denotes t...
متن کاملComputational Complexity of Classical Problems for Hereditary Clique-helly Graphs
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is hereditary clique-Helly when every induced subgraph of it is clique-Helly. The decision problems associated to the stability, chromatic, clique and clique-covering numbers are NP-complete for clique-Helly graphs. In this note, we analyze the complexity of these problems for hereditary clique-Helly graphs. Some of th...
متن کاملHelly Numbers of Polyominoes
We define the Helly number of a polyomino P as the smallest number h such that the h-Helly property holds for the family of symmetric and translated copies of P on the integer grid. We prove the following: (i) the only polyominoes with Helly number 2 are the rectangles, (ii) there does not exist any polyomino with Helly number 3, (iii) there exist polyminoes of Helly number k for any k 6= 1, 3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1101.6006 شماره
صفحات -
تاریخ انتشار 2011