Intersection Patterns of Set Systems on Manifolds with Slowly Growing Homological Shatter Functions
Abstract
A theorem of Matoušek asserts that for any , any set system whose shatter function is enjoys a fractional Helly theorem of order : in the -wise intersection hypergraph, positive density implies a linear-size clique. Kalai and Meshulam conjectured a generalization of that phenomenon to homological shatter functions. It was verified for set systems with bounded homological shatter functions and whose ground set has a forbidden homological minor (which includes by a homological analogue of the van Kampen-Flores theorem). We present two contributions to this line of research:
-
We study homological minors in certain manifolds (possibly with boundary), for which we prove analogues of the van Kampen-Flores theorem and of the Hanani-Tutte theorem.
-
We introduce graded analogues of the Radon and Helly numbers of set systems and relate their growth rate to the original parameters. This allows to extend the verification of the Kalai-Meshulam conjecture to sufficiently slowly growing homological shatter functions.
Keywords and phrases:
Fractional Helly theorem, homological minor, combinatorial convexityCopyright and License:
2012 ACM Subject Classification:
Theory of computation Computational geometryEditors:
Hee-Kap Ahn, Michael Hoffmann, and Amir NayyeriSeries and Publisher:
Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik
1 Introduction
A classical line of research in discrete geometry investigates generalizations of properties of convex sets beyond convexity, with a particular attention to topological conditions. At least three distinct lines of inquiry emerged:
- (A)
- (B)
-
Reformulating properties of convex sets of as properties of linear maps into and investigating their generalizations to continuous maps into , typically via theorems of Borsuk-Ulam type; an early example is the topological Radon theorem of Bajmóczy and Bárány [3] and more examples can be found e.g. in the survey of Bárány and Soberón [5].
- (C)
Two decades ago, Kalai and Meshulam [19] proposed conjectures relating approaches (A) and (C), towards what they called a theory of homological VC dimension. First, in order to generalize the notion of good cover, let us measure the complexity of the intersection patterns of a set system in a topological space by its th homological shatter function
| (1) |
Here is some fixed parameter, and is the th reduced Betti number with coefficients in . (The set systems with are the acyclic covers and include good covers and convex sets.) The conjectures are about nerves of set systems whose intersection patterns have polynomially-growing topological complexity. In particular, their combination [19, Conjectures 6 and 7] (see also [13, Conjecture 1.9]) implies that polynomially-growing homological shatter functions give rise to a “positive density implies big clique” phenomenon:
Conjecture 1 (Kalai and Meshulam).
For any and any function such that , there exists such that the following holds. For any and any set system in with , if a proportion of the -element subsets of have nonempty intersection, then some members of have a point in common.
Such conditions that a positive density of -faces in the nerve implies the existence of a linear-size face is called a fractional Helly theorem (see Section 1.1.1).
Conjecture 1 is a topological analogue of a theorem of Matoušek [25] which asserts that every set system with polynomial (combinatorial) shatter function enjoys a fractional Helly theorem.
Conjecture 1 was confirmed for functions that are bounded ([13, Corollary 1.3], building on [16, 17, 28]). The main contribution of the present paper is to extend that confirmation to some diverging homological shatter functions and to set systems on certain manifolds.
1.1 Context and motivation
Before we state our results precisely (in Section 1.2) let us provide some context and motivation, as well as introduce some necessary terminology.
1.1.1 Combinatorial background: convexity parameters of set systems
The classical theorems of Helly, Radon and Carathéodory have initiated a rich theory of the combinatorial properties of convexity, whose landmarks include the centerpoint theorem, Tverberg’s theorem, the colorful Helly and Carathéodory theorems, the fractional Helly theorem, the selection lemma, the weak -net theorem, the -theorem, etc. We refer the interested reader to the monograph of Bárány [4] and the textbook of Matoušek [22]. These classical convexity theorems have algorithmic consequences for instance in optimization and geometric data analysis [8, ] or in property testing [7], and one motivation for their extension beyond the convex setting is that several of these benefits generalize as well [24, 11].
We can associate to any set system with ground set some parameters inspired by convexity properties, for instance:
-
The Helly number of is the smallest integer with the following property: If in a finite subfamily , every members of intersect, then has nonempty intersection. If no such exists, we set .
-
The Radon number of is the smallest integer such that every -element subset can be partitioned into two nonempty parts such that . (The set , the -convex hull of a subset , is the intersection of all the members of that contain .) If no such exists, we set .
Hence, letting denote the set of all halfspaces in , Radon’s lemma asserts that and Helly theorem that . A classical result by Levi [21] asserts that for every set system we have . (This is often stated for convexity spaces but it holds for set systems, see [2, App. C].) Similar relations between such parameters have been investigated over the years, like for instance the partition conjecture of Eckhoff [10] refuted by Bukh [6].
Conjecture 1 pertains to a parameter inspired by the fractional Helly theorem [20, 18], which asserts that in -wise intersection hypergraphs of convex sets of , positive density implies a linear-size clique. Here is the associated parameter:
-
The fractional Helly number of is the smallest integer such that there exists a function with the following property: For every finite subfamily , whenever a fraction of the -tuples of have nonempty intersection, a subset of of size has nonempty intersection.
Again, the fractional Helly theorem states that . The significance of the fractional Helly number was highlighted by Alon et al. [1], who proved that intersection-closed set systems with bounded fractional Helly number enjoy a weak -net theorem, a Tverberg-type theorem, a selection lemma, etc. It is tempting to reformulate Conjecture 1 as
For any function such that , every set set system in such that has fractional Helly number at most .
We note, however, that this statement is weaker than Conjecture 1 in that it does not assert that the function underpinning the fractional Helly number depends only on and .
1.1.2 Homological background: homological minors
A classical way to extend the theory of planar graphs is to consider embeddings of graphs into surfaces and of simplicial complexes into or other topological spaces.
There is a rich theory of embedding of graphs on surfaces, both structural (a classic being the Heawood inequality [31]) and computational (e.g. the use of graph genus for parameterized complexity). Let us mention, in particular, the strong Hanani-Tutte theorem which asserts that a graph is planar if it can be drawn so that every pair of independent edges cross an even number of times. This statement generalizes to the projective plane [29, 9] but was found to fail in genus 4 [12].
Going to dimension higher than changes the nature of the problems drastically, already because Fáry’s theorem no longer holds. (For every there are simplicial complexes that embed in piecewise linearly but not linearly.) It is thus sometimes convenient to relax the notion of embedding and work with chain maps, and this was done in particular to analyze intersection patterns [14, 28, 13] using a notion of homological minors [35].
Formally, the support of a singular chain is the union of (the images of) the singular simplices with nonzero coefficient in that chain, and the support of a simplicial chain is the subcomplex induced by the simplices with nonzero coefficient in that chain. We write for the support of a (singular or simplicial) chain . A chain map (resp. ) is nontrivial if, for every vertex of , the support of has odd size. Two faces in a simplicial complex are adjacent if they have at least one vertex in common. A homological almost-embedding of a simplicial complex into a topological space (resp. into another simplicial complex ) is a nontrivial chain map (resp. ) such that any two non-adjacent faces have images with disjoint support, that is . In particular, for every embedding the associated chain map is a homological (almost) embedding.
Let denote the -dimensional simplex and for a simplicial complex let denote its -dimensional skeleton. It turns out that there is a homological version of the van Kampen-Flores theorem (see for instance [14, Corollary 14]):
Theorem 2.
For any , does not homologically almost embed into .
A simplicial complex is a homological minor of a topological space or simplicial complex if there is a homological almost-embedding of into . Theorem 2 thus asserts that is not a homological minor of , i.e., that has as forbidden homological minor.
1.1.3 Parameters of set systems with a forbidden homological minor
Matoušek [23] bounded the Helly number of topological set systems in in which every subfamily intersects in a bounded number of connected components, all contractible. His approach starts from a set systems in , uses Ramsey theory to build a map from into that is “constrained” by the known intersection patterns of so that the intersection forced by the van Kampen-Flores theorem reveals a new intersection in .
This approach was generalized by Goaoc et al. [14] to set systems in of bounded -level topological complexity, where the -level topological complexity of is the maximum over of the homological shatter function , that is
| (2) |
That generalization relied on homological minors and replaced the construction of the “constrained map” by the (simpler) construction of a “constrained chain map”. The only aspect of the method that is specific to is the use of the forbidden homological minor given by Theorem 2, so the approach readily generalizes to set systems whose ground set is a topological space with a forbidden homological minor, see the discussions in [28, ] and [13, ]. This method was refined and extended to analyze other parameters of set systems whose ground set has a forbidden homological minor [28, 26, 13].
1.1.4 Proof of Conjecture 1 for bounded homological shatter functions
Conjecture 1 was proven for bounded homological shatter functions in three steps:
-
First, Holmsen and Lee [17, Theorem 1.1] proved that the fractional Helly number of any set system can be bounded by a function of its Radon number. Specifically, letting denote the supremum of the fractional Helly number of a set system with Radon number , they proved that for every we have .
-
Second, Patáková [28, Theorem 2.1] proved that the Radon number of any set system whose ground set has as forbidden homological minor can be bounded by a function of its -level topological complexity.
-
Third, Goaoc, Holmsen and Patáková [13, Theorem 1.2] proved that for every set systems whose ground set has as forbidden homological minor, if the fractional Helly number is bounded then it is at most , where denotes the maximum sum of dimensions of two disjoint simplices in .
1.2 Statement of the results
Our main contribution is to confirm Conjecture 1 for some diverging homological shatter functions and on some manifolds. This decomposes into five independent results.
Throughout the paper, we work with compact piecewise-linear (PL) manifolds (possibly with boundary); see [32, ] for an introduction. We first generalize Theorem 2:
Theorem 3.
For every integers and there exists such that does not homologically almost embed in any compact, -connected, -dimensional PL manifold (possibly with boundary) with .
This partially answers [28, Problem 3], [13, Conjecture 1.7] and [26, Conjecture 2] and extends the previous confirmation of Conjecture 1 from set systems in to set systems on manifolds. This also extends several results on set systems with bounded topological complexity (Helly’s theorem, Radon’s theorem, -theorem, …) from to sufficiently connected manifolds (see [28, 13]). We can relax the connectivity assumption (see [2, App. B]) but not remove it.
One ingredient in the proof of Theorem 3 is the following analogue of the Hanani-Tutte theorem for homological almost-embeddings, which is of independent interest.
Theorem 4.
Let be a simplicial complex of dimension and let be a compact -dimensional PL manifold (possibly with boundary). If there exists a triangulation of and a non-trivial chain map in general position such that the images of any two non-adjacent -faces intersect in an even number of points, then is a homological minor of .
We formalize what we mean by general position in Section 2.
The homological shatter function defined in Equation (1) can be reformulated as a graded version of the topological complexity defined in Equation (2), where the value for parameter considers only intersections of subfamilies of size at most : . We systematize this viewpoint and define graded analogues of other parameters of set systems. For instance here are the graded Radon and graded Helly numbers:
| (3) |
It is straightforward to see that if the graded Helly numbers of a set system do not grow fast enough, then they are ultimately stationary and the set system has bounded Helly number (Lemma 10). We prove a similar condition for (graded) Radon numbers:
Theorem 5.
Let be a set system. If , then .
As a application, we extend Patáková’s theorem from bounded to sufficiently slowly diverging homological shatter function (Corollary 12). This, in turns yields fractional Helly theorems for sufficiently slowly diverging homological shatter functions.
Corollary 6.
For every simplicial complex there exists a function with such that the following holds. If is a set system whose ground set has as forbidden homological minor and such that for large enough, then has fractional Helly number at most .
We then investigate more graded numbers and establish more relations between graded and ungraded numbers. As an application, we extend the Holmsen-Lee bound on . Let be the function defined by .
Theorem 7.
Let and such that for every . If there exists an integer such that , then every set system whose graded Radon number function is bounded from above by has bounded fractional Helly number.
2 On homological minors
In this section we prove Theorems 3 and 4. For completeness, we start with a consequence of the simplicial approximation theorem that allows us to work purely in simplicial homology:
Lemma 8 ([2, App. A]).
A simplicial complex is a homological minor of a compact PL manifold (possibly with boundary) if and only if is a homological minor of some triangulation of .
When counting intersection points between chains, we focus on intersections that are stable under small perturbation. We therefore consider generic intersections, meaning intuitively that the chains intersect transversally. We formalize this in terms of linking numbers.111Intuitively, this generalizes the idea that in the plane, two curves cross at a point if the branches of the curves alternate around .
Let be a triangulation of . Let and be two subcomplexes of with and homeomorphic to . Suppose that the simplicial complex induced by on the vertices not in has a geometric realization homotopy equivalent to (this can always be ensured up to taking a subdivision of ). The linking number of and in is if the homology class generates , and if is trivial in . (Exchanging and in this definition yields the same result.)
Let be a triangulation of a compact PL manifold (possibly with boundary) . Two -chains intersect generically in vertex if the closed star of in satisfies: , and are -dimensional balls, and the spheres and have linking number in . Two -chains are in general position if consists of finitely many vertices, and and intersect generically in each of these vertices. Two -chains intersect evenly if they are in general position and has even size.
For a -dimensional complex, a simplicial chain map is in general position if for every non-adjacent -faces , the chains and are in general position and for each vertex , and are the only faces of whose images under intersect the closed star of in . We say that a simplicial map is in general position if the associated chain map is.
For any compact PL manifold (possibly with boundary) of dimension , there exists a map , called the intersection form of , such that counts the intersection points of and modulo . We use no property of intersection forms besides their existence, and refer the interested reader to Prasolov [30, Chapter 2, 2.7] for a precise definition and to Paták and Tancer [27] for an brief account.
The next result is due to Paták and Tancer [27, Proposition 21] and formulated following the presentation of Skopenkov [33], which is better suited for our purpose. (More precisely, we reformulated [33, Theorem 1.1.5] using [33, Lemma 2.1.1].) Note that the proofs by Paták-Tancer [27] and by Skopenkov [33] use only PL maps.
Theorem 9.
Let be a simplicial complex of dimension and let be a compact, -connected, -dimensional PL manifold (possibly with boundary). The following statements are equivalent:
-
(i)
There exists a triangulation of and a simplicial map in general position such that the images of any two non-adjacent faces intersect evenly.
-
(ii)
There exists a triangulation of and a simplicial map in general position and a map that sends each -face of to an element of such that any two non-adjacent -faces have images that intersect in an even number of points if and only if .
2.1 A homological Hanani-Tutte theorem
Let us now prove Theorem 4. Let be a simplicial complex of dimension and let be a triangulation of a compact PL manifold (possibly with boundary) of dimension . Let be a non-trivial chain map in general position such that the images of any two non-adjacent -faces intersect evenly.
Our goal is to prove that is a homological minor of . This requires repeatedly subdividing the triangulation . In what follows, every time we subdivide a triangulation into , all chain maps to and subcomplexes of are also subdivided to . Also, throughout the proof we identify every pure -dimensional simplicial complex with the unique -chain with coefficients in it supports; we abuse the terminology and say that we add (pure) simplicial complexes over to mean that we add the corresponding chains.
If is a homological almost-embedding we are done. Otherwise, there exist some non-adjacent -faces such that is non-empty. By assumption, this intersection is a set of vertices of even size, so let be two distinct such vertices. Recall that is in general position, and intersect generically in and in . We set out to construct a refinement of and a new map that is also in general position, differs from only on and , and satisfies as well as for any and any -face . Iterating this procedure produces the announced homological almost-embedding of into a triangulation of .
Let and denote the closed stars of and in . For and let . Since and intersect generically in and , the complexes and are -dimensional balls, the -spheres and have linking number in , and similarly and have linking number in .
We subdivide into so that the closed star of and of in are disjoint from and , respectively. In particular, for and , letting , the pair is homeomorphic to . The genericity of and in is preserved through the subdivision so the four complexes are -dimensional balls and their bounding spheres have the same linking numbers in and as their counterparts on and .
Up to subdividing into , there exist vertices and in and , respectively, and a path in the 1-skeleton of from to such that, letting denote the closed star of in , the closed star of is disjoint from the image of . The union is a ball. Observe that in , the -spheres and retain the linking number that they have on . Similarly, in , the -spheres and retain the linking number that they have on .
Thus, up to further subdividing into , there exist a path in the 1-skeleton of that connects to and with relative interiors disjoint from the image of . (Here we use that is of codimension in .) Up to subdividing the triangulation further, we can pipe and together by a tube found in a neighborhood of the path [32, ]. The tube is homeomorphic to . Moreover, by the (PL) general position theorem for embeddings [32, 5.3], we can take such that and intersect in a generic way. By taking in a sufficiently small neighborhood of so that is homeomorphic to , and the triple is homeomorphic to .
Now, let be the sum (over ). Note that is contained in the union of and the closed star of , and therefore intersects the image of only inside . We note that also pipes the -spheres and . Indeed, , is homeomorphic to . It follows that is homeomorphic to the connected sum of two -spheres, and is therefore homeomorphic to a -sphere.
We claim that, in , the linking number between and equals the linking number between and , that is . This follows from the fact that the chain differs from by , and that each of and is a boundary in . The same claim holds if we exchange for .
Altogether, we get that and are in the same homology class in . Hence, their sum is a boundary, and there exists a chain such that the support of is the sum over of and . We finally set
We set for every other face . Extending linearly yields a chain map, since both and are cycles 222They are even boundaries, ensuring that is chain homotopic to . The chain map is as announced: and every other intersection remains unchanged. This concludes the proof of Theorem 4.
2.2 Forbidden homological minors for manifolds
We now prove Theorem 3. First, note that the odd-dimensional case reduces to the even-dimensional one. Indeed, for every , if is a compact, -connected, -dimensional PL manifold (possibly with boundary), then is a compact, -connected, -dimensional PL manifold (possibly with boundary). Moreover, and any homological minor of is a homological minor of . If the statement holds for even and with some , then it holds with and by putting . So let us now consider the even-dimensional case.
Let and , and let be a compact, -connected, -dimensional PL manifold (possibly with boundary). Let us fix and suppose that is a homological minor of . By Lemma 8, there exist a triangulation of and a (simplicial) homological almost-embedding . Actually, letting , we have that there exists a homological almost-embedding .
We apply Theorem 9 with . Condition (i) holds with and the identity, so Condition (ii) also holds. Hence, there exists a triangulation of , a simplicial map in general position, and a map that sends each -face of to an element of such that any two non-adjacent -faces intersect evenly if and only if . We let denote the linear extension of .
Consider the chain map defined by . Note that is nontrivial since is nontrivial and is a simplicial map. Moreover, the fact that is a chain map in general position follows from three observations:
-
since is a simplicial map in general position, is a chain map in general position,
-
since is a homological almost-embedding, it is also a chain map in general position, and
-
the composition of a homological almost-embedding and a chain map in general position is a chain map in general position.
Notice that for , not every independent -faces of can have images under that intersect evenly. Indeed Theorem 4 would then imply that is a homological minor of , which would contradict the homological van Kampen-Flores theorem (Theorem 2). We use Ramsey’s theorem to show that this contradiction can be reached for some subcomplex of .
So consider two non-adjacent -faces and put and . Since is a homological almost-embedding, and are disjoint, and and are thus non-adjacent for every . Hence, given , and intersect evenly if and only if . We can thus count the intersections of and (the following equalities are modulo and denotes the cardinal):
Let . The map defined by induces a coloring of the -simplices of by the (at most ) elements of . Let denote the number of vertices of . By the hypergraph Ramsey theorem, for large enough (as a function of and ) there exists a subset of vertices in such that is constant over all -simplices of ; let us denote by this constant value. In particular, for every -faces of such that and are not adjacent, we have, modulo , . Let us fix a bijection from the vertices of to and extend it to a chain map . Also, let denote the subdivision chain map, where each -face of is mapped to the sum of the -faces of that it contains. In particular, for every -face of , the chain is supported on -faces of .
Let us examine the properties of . First, it is a nontrivial chain map (because , and are). Moreover, is a homological almost-embedding (since and are), and its composition with the chain map in general position yields a chain map in general position. Furthermore, any two non-adjacent -faces have images under that intersect evenly. To see this, let us put and . Since is a homological almost-embedding, and are disjoint. It follows that for every the -simplices and are non-adjacent. We therefore have, modulo 2,
To sum up, the cardinal of has the same parity as . Since is even, and have images under that intersect evenly.
To conclude, is a nontrivial chain map in general position from to such that independent faces have images that intersect evenly. By Theorem 4 this means that is a homological minor of , a contradiction with Theorem 2. Thus, for large enough, the initial hypothesis that is a homological minor of cannot be true.
3 Graded parameters of set systems
In this section we present our contributions on set systems of parameters.
3.1 Graded Radon and Helly numbers
Each relation between parameters of a set system yields a relation between their graded analogues. From Levi’s inequality we get the following inequality between the graded Helly and Radon numbers (defined in Section 1.1.1):
| (4) |
It follows from the definitions of graded parameters that each one is a non-decreasing function that converges to the ungraded parameter (possibly ). We notice that if a graded Helly number is asymptotically sublinear then it is bounded:
Lemma 10.
Let be a set system and . If for all , then .
Proof.
By definition, we have for every . Moreover, if and only if . The assumption and a straightforward induction therefore implies that for every we have . The growth of graded Radon numbers is at most linear [2, App. D] and rather constrained:
Lemma 11.
Let be a set system and an integer. If , then .
Proof.
Let denote the ground set of and let . Suppose that , so that there exist a subset and a subset of size such that
-
(i)
there is no partition of into two parts whose -convex hulls intersect,
-
(ii)
for every , there exists a partition of into two parts whose -convex hulls intersect.
Recall that given , the -convex hull of a subset is the intersection of all the members of that contain . In particular, for any such that we have . Conditions (i) and (ii) therefore imply that every contains one or the other part of .
There are at most partitions of in two nonempty parts. Let us assume that for some integer , so that by the pigeonhole principle there exist indices such that the partitions , …, coincide. Let be that partition of . Let us put . We make two observations:
-
coincides with and is therefore empty.
-
every choice of elements in has nonempty intersection. Indeed, contains , , …, , so that any choice of elements from is bound to miss for at least one and their intersection must then contain .
For these conditions are incompatible. We therefore have , and the statement follows.
We can now prove that any set system with sufficiently slowly growing graded Radon numbers has finite Radon number.
Proof of Theorem 5.
Let be a set system with infinite Radon number. If the Helly number is also infinite, then by Lemma 10 there exists an increasing sequence such that , and therefore by Inequality (4); this prevents from going to as . So suppose that the Helly number is finite. The assumption that ensures that there exists an increasing sequence such that . Lemma 11 implies that . Again, this prevents from going to as . The statement follows by contraposition.
3.2 Consequences for topological set systems
Let us finally consider topological set systems with slowly growing homological shatter function and ground set with a forbidden homological minor.
Corollary 12.
For every simplicial complex there exists a function with such that the following holds. Any set system whose ground set has as forbidden homological minor and satisfies for large enough has finite Radon number.
Proof.
Recall that denotes the supremum of the Radon number of a set system with -level topological complexity at most and whose ground set has as forbidden homological minor. Patáková [28] proved that is finite for every and .
For , we define . This ensures that for every . Observe that since is finite for every .
Now consider a set system with function and whose ground set has as forbidden homological minor. Let and consider a subset of size . The ground set of also has as forbidden homological minor. Moreover, has -level topological complexity at most . It follows that . This holds for every of size , so . This inequality holds for every so Theorem 5 implies that has bounded Radon number. We can finally prove a fractional Helly theorem for diverging homological shatter functions.
Proof of Corollary 6.
Recall that denotes the supremum of the fractional Helly number of a set system with Radon number . Holmsen and Lee [17, Theorem 1.1] proved that is finite for every . Let denote the function from Corollary 12. Now consider a set system whose ground set has as forbidden homological minor and satisfies . Corollary 12 ensures that , the Radon number of , is finite. It follows that the fractional Helly number of is at most , and is therefore finite. From there, [13, Theorem 1.2] ensures that this fractional Helly number is at most .
3.3 Other graded parameters and relations
With the intersection hypergraph of in mind, we say that a set in a set system is a clique if the intersection of all members of is non-empty. The colorful Helly theorem suggests the following parameter:
-
The colorful Helly number of is the smallest number of colors such that for every coloring of a subfamily with colors, if every subfamily that contains exactly one element of each color is a clique, then at least one color class is a clique.
We say that a set in a set system is a -wise clique if every -element subset of is a clique. Clearly a clique is a -wise clique, and when the converse is true. To analyze set systems with large, infinite or unknown Helly numbers, it is useful to consider variants of the colorful and fractional Helly numbers where cliques are replaced by -wise cliques:
-
The th colorful Helly number of is the smallest number of colors such that for every coloring of a subfamily with colors, if every subfamily of that contains exactly one element of each color forms a -wise clique, then at least one color class is a -wise clique.
-
The th fractional Helly number of is the smallest integer such that there exists a function with the following property: For every finite subfamily , whenever a fraction of the -tuples of forms a -wise clique, a subset of of size forms a -wise clique.
Obviously for every set system , if , then and . Holmsen [16, Theorem 1.2] proved that for every set system and every . A close inspection of that proof provides another bridge between the graded and ungraded parameters:
Lemma 13.
Let be integers. Every set system such that satisfies .
Proof.
Let , let be a set system and let . By definition of , the -uniform hypergraph recording which -element subsets of form cliques cannot contain a certain pattern on vertices, namely the complete -tuples of missing edges [17, ]. This is the only property needed to ensure that [16, Theorem 1.2].
Let denote the supremum of the th colorful Helly number of a set system with Radon number . Holmsen and Lee [17, Theorem 2.2] proved that for every , where is the function defined by . Applying this inequality to subsets of size we get:
| (5) |
Proof of Theorem 7.
Let and such that for every . Also suppose that there exists an integer such that . We now consider a set system such that for every and argue that , the fractional Helly number of , is bounded.
By Levi’s inequality (4) we have . It follows that for every , so by Lemma 10 we have . Hence, the graded version (5) of the Holmsen-Lee inequality applies with and every , that is .
Let us apply Lemma 13 with and . Observe that holds because , and that follows from the assumption that , as
Hence, . Since we have and the statement follows.
References
- [1] Noga Alon, Gil Kalai, Jirí Matoušek, and Roy Meshulam. Transversal numbers for hypergraphs arising in geometry. Advances in Applied Mathematics, 29:79–101, 2002. doi:10.1016/S0196-8858(02)00003-9.
- [2] Sergey Avvakumov, Marguerite Bin, and Xavier Goaoc. Intersection patterns of set systems on manifolds with slowly growing homological shatter functions, 2026. arXiv:2601.02920.
- [3] Ervin G. Bajmóczy and Imre Bárány. On a common generalization of borsuk’s and radon’s theorem. Acta Mathematica Hungarica, 34(3-4):347–350, 1979.
- [4] Imre Bárány. Combinatorial convexity, volume 77. American Mathematical Soc., 2021.
- [5] Imre Bárány and Pablo Soberón. Tverberg’s theorem is 50 years old: a survey. Bulletin of the American Mathematical Society, 55(4):459–492, 2018.
- [6] Boris Bukh. Radon partitions in convexity spaces, 2010. arXiv:1009.2384.
- [7] Sourav Chakraborty, Rameshwar Pratap, Sasanka Roy, and Shubhangi Saraf. Helly-type theorems in property testing. International Journal of Computational Geometry & Applications, 28(04):365–379, 2018. doi:10.1142/S0218195918500115.
- [8] Jesús De Loera, Xavier Goaoc, Frédéric Meunier, and Nabil Mustafa. The discrete yet ubiquitous theorems of carathéodory, helly, sperner, tucker, and tverberg. Bulletin of the American Mathematical Society, 56(3):415–511, 2019.
- [9] Éric Colin de Verdière, Vojtěch Kaluža, Pavel Paták, Zuzana Patáková, and Martin Tancer. A direct proof of the strong hanani-tutte theorem on the projective plane. Journal of Graph Algorithms and Applications, 21(5):939–981, 2017. doi:10.7155/JGAA.00445.
- [10] Jürgen Eckhoff. The partition conjecture. Discrete Mathematics, 221(1):61–78, 2000. doi:10.1016/S0012-365X(99)00386-6.
- [11] Rogers Epstein and Sandeep Silwal. Property Testing of LP-Type Problems. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), volume 168 of Leibniz International Proceedings in Informatics (LIPIcs), pages 98:1–98:18, 2020. doi:10.4230/LIPIcs.ICALP.2020.98.
- [12] Radoslav Fulek and Jan Kynčl. Counterexample to an extension of the hanani-tutte theorem on the surface of genus 4. Combinatorica, 39(6):1267–1279, 2019. doi:10.1007/S00493-019-3905-7.
- [13] Xavier Goaoc, Andreas F. Holmsen, and Zuzana Patáková. Intersection patterns in spaces with a forbidden homological minor, 2024. arXiv:2103.09286.
- [14] Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner. Bounding Helly numbers via Betti numbers. In A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek, pages 407–447. Springer, 2017.
- [15] Eduard Helly. Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten. Monatshefte für Mathematik und Physik, 37:281–302, 1930.
- [16] Andreas F. Holmsen. Large cliques in hypergraphs with forbidden substructures. Combinatorica, 40(4):527–537, August 2020. doi:10.1007/S00493-019-4169-Y.
- [17] Andreas F. Holmsen and Donggyu Lee. Radon numbers and the fractional Helly theorem. Israel Journal of Mathematics, 241(1):433–447, March 2021.
- [18] Gil Kalai. Intersection patterns of convex sets. Israel Journal of Mathematics, 48(2):161–174, 1984.
- [19] Gil Kalai. Combinatorial expectations from commutative algebra. In I. Peeva anv V. Welker, editor, Combinatorial Commutative Algebra, volume 1(3), pages 1729–1734. Oberwolfach Reports, 2004.
- [20] Meir Katchalski and Andy Liu. A problem of geometry in . Proceedings of the American Mathematical Society, 75(2):284–288, 1979.
- [21] Friedrich W. Levi. On Helly’s theorem and the axioms of convexity. Journal of the Indian Mathematical Society, 15:65–76, 1951.
- [22] Jiři Matoušek. Lectures on discrete geometry, volume 212. Springer Science & Business Media, 2013.
- [23] Jirí Matoušek. A Helly-type theorem for unions of convex sets. Discrete & Computational Geometry, 18:1–12, 1997. doi:10.1007/PL00009305.
- [24] Jirí Matoušek, Micha Sharir, and Emo Welzl. A subexponential bound for linear programming. Algorithmica, 16(4-5):498–516, 1996. doi:10.1007/BF01940877.
- [25] Jirí Matoušek. Bounded VC-dimension implies a fractional Helly theorem. Discrete & Computational Geometry, 31:251–255, 2004. doi:10.1007/S00454-003-2859-Z.
- [26] Pavel Paták. A sharper ramsey theorem for constrained drawings. Journal of Graph Theory, 109(4):401–411, 2025.
- [27] Pavel Paták and Martin Tancer. Embeddings of k-complexes into 2 k-manifolds. Discrete & Computational Geometry, 71(3):960–991, 2024. doi:10.1007/S00454-023-00595-W.
- [28] Zuzana Patáková. Bounding Radon number via Betti numbers. International Mathematics Research Notices, 2024(11):9482–9500, 2024.
- [29] Michael J Pelsmajer, Marcus Schaefer, and Despina Stasi. Strong hanani–tutte on the projective plane. SIAM Journal on Discrete Mathematics, 23(3):1317–1323, 2009. doi:10.1137/08072485X.
- [30] Victor V. Prasolov. Elements of homology theory, volume 81. American Mathematical Society, 2007.
- [31] Gerhard Ringel. Map color theorem, volume 209. Springer Science & Business Media, 2012.
- [32] Colin Rourke and Brian Sanderson. Introduction to Piecewise-Linear Topology. Springer Study Edition. Springer Berlin, Heidelberg, 1972.
- [33] Arkadiy Skopenkov. Embeddings of -complexes in -manifolds and minimum rank of partial symmetric matrices, 2024. arXiv:2112.06636.
- [34] Martin Tancer. Intersection patterns of convex sets via simplicial complexes: a survey. In Thirty essays on geometric graph theory, pages 521–540. Springer, 2012.
- [35] Uli Wagner. Minors, embeddability, and extremal problems for hypergraphs. In Thirty Essays on Geometric Graph Theory, pages 569–607. Springer, 2012.
