Abstract 1 Introduction 2 On homological minors 3 Graded parameters of set systems References

Intersection Patterns of Set Systems on Manifolds with Slowly Growing Homological Shatter Functions

Sergey Avvakumov ORCID School of Mathematical Sciences, Tel Aviv University, Israel    Marguerite Bin ORCID Université de Lorraine, CNRS, INRIA, LORIA, F-54000 Nancy, France    Xavier Goaoc ORCID Université de Lorraine, CNRS, INRIA, LORIA, F-54000 Nancy, France
Abstract

A theorem of Matoušek asserts that for any k≥2, any set system whose shatter function is o⁢(nk) enjoys a fractional Helly theorem of order k: in the k-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 ℝd 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 convexity
Copyright and License:
[Uncaptioned image] © Sergey Avvakumov, Marguerite Bin, and Xavier Goaoc; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Theory of computation → Computational geometry
Related Version:
Full Version: https://arxiv.org/abs/2601.02920 [2]
Editors:
Hee-Kap Ahn, Michael Hoffmann, and Amir Nayyeri

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)

Generalizing families of convex sets into acyclic/good covers, meaning set systems in topological spaces such that every subfamily has empty or homologically/homotopically trivial intersection; an early example is Helly’s topological theorem [15], see also the survey of Tancer [34] for an overview.

(B)

Reformulating properties of convex sets of ℝd as properties of linear maps into ℝd and investigating their generalizations to continuous maps into ℝd, 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)

Analyzing set systems whose nerve enjoy properties of nerves of convex sets, like d-collapsibility or d-Lerayness; an early example is the sharpening of the Fractional Helly theorem by Kalai [18] and the work of Alon et al. [1] establishes several landmark results.

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 hth homological shatter function

ϕℱ(h):{ℕ→ℕ∪{∞}k↦sup{βi~⁢(⋂F∈𝒢F;ℤ2)|𝒢⊂ℱ,|𝒢|≤k,0≤i≤h}. (1)

Here h is some fixed parameter, and β~i⁢(⋅;ℤ2) is the ith reduced Betti number with coefficients in ℤ2. (The set systems ℱ with ϕℱ(∞)≡0 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 d∈ℕ and any function Ψ:ℕ→ℕ such that Ψ⁢(n)=O⁢(nd), there exists β:(0,1)→(0,1) such that the following holds. For any α>0 and any set system ℱ in ℝd with ϕℱ(d)≤Ψ, if a proportion α of the (d+1)-element subsets of ℱ have nonempty intersection, then some β⁢(α)⁢|ℱ| members of ℱ have a point in common.

Such conditions that a positive density of d-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 (p,q)-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, §⁢ 6−7] 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 X some parameters inspired by convexity properties, for instance:

  • ■

    The Helly number hℱ of ℱ is the smallest integer h with the following property: If in a finite subfamily 𝒢⊂ℱ, every h members of 𝒢 intersect, then 𝒢 has nonempty intersection. If no such h exists, we set hℱ=∞.

  • ■

    The Radon number rℱ of ℱ is the smallest integer r such that every r-element subset S⊂X can be partitioned into two nonempty parts S=P1⊔P2 such that convℱ⁡(P1)∩convℱ⁡(P2)≠∅. (The set convℱ⁡(P), the ℱ-convex hull of a subset P⊂X, is the intersection of all the members of ℱ that contain P.) If no such r exists, we set rℱ=∞.

Hence, letting 𝒞d denote the set of all halfspaces in ℝd, Radon’s lemma asserts that r𝒞d=d+2 and Helly theorem that h𝒞d=d+1. A classical result by Levi [21] asserts that for every set system ℱ we have hℱ≤rℱ−1. (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 (d+1)-wise intersection hypergraphs of convex sets of ℝd, positive density implies a linear-size clique. Here is the associated parameter:

  • ■

    The fractional Helly number fhℱ of ℱ is the smallest integer s such that there exists a function βℱ:(0,1)→(0,1) with the following property: For every finite subfamily ℱ′⊂ℱ, whenever a fraction α of the s-tuples of ℱ′ have nonempty intersection, a subset 𝒢 of ℱ′ of size βℱ⁢(α)⁢|ℱ′| has nonempty intersection.

Again, the fractional Helly theorem states that fh𝒞d=d+1. 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 Ψ⁢(n)=O⁢(nd), every set set system ℱ in ℝd such that ϕℱ(d)≤Ψ has fractional Helly number at most d+1.

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 d.

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 ℝd 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 2 changes the nature of the problems drastically, already because Fáry’s theorem no longer holds. (For every d≥3 there are simplicial complexes that embed in ℝd 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 supp⁡(σ) for the support of a (singular or simplicial) chain σ. A chain map a:C∗⁢(K)→C∗sing⁡(X) (resp. a:C∗⁢(K)→𝒞∗⁢(T)) is nontrivial if, for every vertex v of K, the support of a⁢(v) has odd size. Two faces in a simplicial complex K are adjacent if they have at least one vertex in common. A homological almost-embedding of a simplicial complex K into a topological space X (resp. into another simplicial complex L) is a nontrivial chain map a:C∗⁢(K)→C∗sing⁡(X) (resp. a:C∗⁢(K)→C∗⁢(L)) such that any two non-adjacent faces σ,τ∈K have images with disjoint support, that is supp⁡(a⁢(σ))∩supp⁡(a⁢(τ))=∅. In particular, for every embedding f the associated chain map f# is a homological (almost) embedding.

Let ΔN denote the N-dimensional simplex and for K a simplicial complex let K(t) denote its t-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 d≥1, Δd+2(⌈d/2⌉) does not homologically almost embed into ℝd.

A simplicial complex K is a homological minor of a topological space or simplicial complex X if there is a homological almost-embedding of K into X. Theorem 2 thus asserts that Δd+2(⌈d/2⌉) is not a homological minor of ℝd, i.e., that ℝd has Δd+2(⌈d/2⌉) 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 ℝd in which every subfamily intersects in a bounded number of connected components, all contractible. His approach starts from a set systems in ℝd, uses Ramsey theory to build a map from Δd+2(⌈d/2⌉) into ℝd 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 ℝd of bounded ⌈d/2⌉-level topological complexity, where the h-level topological complexity of ℱ is the maximum over ℕ of the homological shatter function ϕℱ(h), that is

hcℱ(h):=max⁡{max0≤i<h⁡βi~⁢(⋂A∈𝒢A;ℤ2)|𝒢⊂ℱ}. (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 ℝd 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, §⁢5.2] and [13, §⁢2.2]. 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 Ψr→fh⁢(x) denote the supremum of the fractional Helly number of a set system with Radon number x, they proved that for every r≥3 we have Ψr→fh⁢(r)≤rr⌈log2⁡r⌉+r⁢⌈log2⁡r⌉.

  • ■

    Second, Patáková [28, Theorem 2.1] proved that the Radon number of any set system whose ground set has K as forbidden homological minor can be bounded by a function of its (dimK)-level topological complexity.

  • ■

    Third, Goaoc, Holmsen and Patáková [13, Theorem 1.2] proved that for every set systems ℱ whose ground set has K as forbidden homological minor, if the fractional Helly number fhℱ is bounded then it is at most μ⁢(K)+1, where μ⁢(K) denotes the maximum sum of dimensions of two disjoint simplices in K.

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, §⁢1] for an introduction. We first generalize Theorem 2:

Theorem 3.

For every integers d≥3 and b there exists N=N⁢(d,b) such that ΔN(⌈d/2⌉) does not homologically almost embed in any compact, (⌈d/2⌉−1)-connected, d-dimensional PL manifold (possibly with boundary) ℳ with β⌈d/2⌉⁢(ℳ;ℤ2)≤b.

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 ℝd to set systems on manifolds. This also extends several results on set systems with bounded topological complexity (Helly’s theorem, Radon’s theorem, (p,q)-theorem, …) from ℝd 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 K be a simplicial complex of dimension k>1 and let ℳ be a compact 2⁢k-dimensional PL manifold (possibly with boundary). If there exists a triangulation T of ℳ and a non-trivial chain map f:C∗⁢(K;ℤ2)→C∗⁢(T;ℤ2) in general position such that the images of any two non-adjacent k-faces σ,τ∈K intersect in an even number of points, then K is a homological minor of ℳ.

We formalize what we mean by general position in Section 2.

The homological shatter function Φℱ(h) defined in Equation (1) can be reformulated as a graded version of the topological complexity hcℱ(h) defined in Equation (2), where the value for parameter t considers only intersections of subfamilies of size at most t: ϕℱ(h)⁢(t)=supℱ′⊂ℱ|ℱ′|≤thcℱ′(h). 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:

rℱ⁡(t)≔supℱ′⊂ℱ|ℱ′|≤trℱ′andhℱ⁡(t)≔supℱ′⊂ℱ|ℱ′|≤thℱ′. (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 limt→∞rℱ⁡(t)−log2⁡t=−∞, then rℱ<∞.

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 K there exists a function ΨK:ℕ→ℕ with limt→∞ΨK⁢(t)=+∞ such that the following holds. If ℱ is a set system whose ground set has K as forbidden homological minor and such that ϕℱ(dimK)⁢(t)≤ΨK⁢(t) for t large enough, then ℱ has fractional Helly number at most (μ⁢(K)+1).

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 Ψr→fh⁢(⋅). Let Ξ:ℕ→ℕ be the function defined by Ξ⁢(r):=rr⌈log2⁡r⌉+r⁢⌈log2⁡r⌉.

Theorem 7.

Let Ψ:ℕ→ℕ and t0∈ℕ such that Ψ⁢(t)<t+1 for every t≥t0. If there exists an integer t1≥t02 such that Ξ⁢(Ψ⁢(t1))<t1t0, then every set system whose graded Radon number function is bounded from above by Ψ has bounded fractional Helly number.

With Theorem 7 we can strengthen Corollary 6, as a close inspection of the proof reveals that the function β associated to the fractional Helly number depends only on Ψ and t0. (It also allows a slightly faster growth than Corollary 12.) We postpone this to the full version of the paper.

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 K is a homological minor of a compact PL manifold (possibly with boundary) ℳ if and only if K 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 x if the branches of the curves alternate around x.

Let X be a triangulation of 𝕊2⁢k−1. Let S1 and S2 be two subcomplexes of X with |S1| and |S2| homeomorphic to 𝕊k−1. Suppose that the simplicial complex X∖S2 induced by X on the vertices not in S2 has a geometric realization homotopy equivalent to 𝕊2⁢k−1∖𝕊k−1 (this can always be ensured up to taking a subdivision of X). The linking number of S1 and S2 in X is 1 if the homology class [S1] generates Hk−1⁢(X∖S2;ℤ2)≅ℤ2, and 0 if [S1] is trivial in Hk−1⁢(X∖S2;ℤ2). (Exchanging S1 and S2 in this definition yields the same result.)

Let T be a triangulation of a compact PL manifold (possibly with boundary) ℳ. Two k-chains z1,z2∈Ck⁢(T;ℤ2) intersect generically in vertex v if the closed star B of v in T satisfies: B∩z1∩z2={v}, D1:=z1∩B and D2:=z2∩B are k-dimensional balls, and the spheres ∂D1 and ∂D2 have linking number 1 in ∂B. Two k-chains z1,z2∈Ck⁢(T;ℤ2) are in general position if z1∩z2 consists of finitely many vertices, and z1 and z2 intersect generically in each of these vertices. Two k-chains z1,z2∈Ck⁢(T;ℤ2) intersect evenly if they are in general position and im⁡(z1)∩im⁡(z2) has even size.

For K a k-dimensional complex, a simplicial chain map f:C∙⁢(K;ℤ2)→C∙⁢(T;ℤ2) is in general position if for every non-adjacent k-faces σ,τ∈K, the chains f⁢(σ) and f⁢(τ) are in general position and for each vertex v∈f⁢(σ)∩f⁢(τ), σ and τ are the only faces of K whose images under f intersect the closed star of v in T. We say that a simplicial map f:K→T is in general position if the associated chain map f# is.

For any compact PL manifold (possibly with boundary) ℳ of dimension 2⁢k, there exists a map ∩ℳ:Hk(ℳ;ℤ2)×Hk(ℳ;ℤ2)→ℤ2, called the intersection form of ℳ, such that ∩ℳ([z1],[z2])∈ℤ2 counts the intersection points of z1 and z2 modulo 2. 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 L be a simplicial complex of dimension k>1 and let ℳ be a compact, (k−1)-connected, 2⁢k-dimensional PL manifold (possibly with boundary). The following statements are equivalent:

  1. (i)

    There exists a triangulation T of ℳ and a simplicial map f:L→T in general position such that the images of any two non-adjacent faces intersect evenly.

  2. (ii)

    There exists a triangulation R of ℝ2⁢k and a simplicial map g:L→R in general position and a map α that sends each k-face of L to an element of Hk⁢(ℳ;ℤ2) such that any two non-adjacent k-faces σ,τ∈L have images that intersect in an even number of points if and only if ∩ℳ(α⁢(σ),α⁢(τ))=0.

2.1 A homological Hanani-Tutte theorem

Let us now prove Theorem 4. Let K be a simplicial complex of dimension k>1 and let T be a triangulation of a compact PL manifold (possibly with boundary) ℳ of dimension 2⁢k. Let f:C∗⁢(K;ℤ2)→C∗⁢(T;ℤ2) be a non-trivial chain map in general position such that the images of any two non-adjacent k-faces σ,τ∈K intersect evenly.

Our goal is to prove that K is a homological minor of ℳ. This requires repeatedly subdividing the triangulation T. In what follows, every time we subdivide a triangulation Ti into Ti+1, all chain maps to Ti and subcomplexes of Ti are also subdivided to Ti+1. Also, throughout the proof we identify every pure ℓ-dimensional simplicial complex with the unique ℓ-chain with coefficients in ℤ2 it supports; we abuse the terminology and say that we add (pure) simplicial complexes over ℤ2 to mean that we add the corresponding chains.

If f is a homological almost-embedding we are done. Otherwise, there exist some non-adjacent k-faces σ,τ∈K such that f⁢(σ)∩f⁢(τ) is non-empty. By assumption, this intersection is a set of vertices of even size, so let x,y∈f⁢(σ)∩f⁢(τ) be two distinct such vertices. Recall that f is in general position, f⁢(σ) and f⁢(τ) intersect generically in x and in y. We set out to construct a refinement T′ of T and a new map f′:C∗⁢(K;ℤ2)→C∗⁢(T′;ℤ2) that is also in general position, differs from f only on σ and τ, and satisfies f′⁢(σ)∩f′⁢(τ)=(f⁢(σ)∩f⁢(τ))∖{x,y} as well as f′⁢(α)∩f′⁢(β)=f⁢(α)∩f⁢(β) for any α∈{σ,τ} and any k-face β∈K∖{σ,τ}. Iterating this procedure produces the announced homological almost-embedding of K into a triangulation of ℳ.

Figure 1: The setup for the construction of T′ and f′.

Let Bx and By denote the closed stars of x and y in T. For z∈{x,y} and α∈{σ,τ} let Dα,z:=supp⁡(f⁢(α))∩Bz. Since f⁢(σ) and f⁢(τ) intersect generically in x and y, the complexes Dσ,x,Dσ,y,Dτ,x and Dτ,y are k-dimensional balls, the (k−1)-spheres ∂Dσ,x and ∂Dτ,x have linking number 1 in ∂Bx, and similarly ∂Dσ,y and ∂Dτ,y have linking number 1 in ∂By.

We subdivide T into T1 so that the closed star Bx′ of x and By′ of y in T1 are disjoint from ∂Bx and ∂By, respectively. In particular, for z∈{x,y} and α∈{σ,τ}, letting Dα,z′:=supp⁡(f⁢(α))∩Bz′, the pair (∂Dα,z′,∂Bz′) is homeomorphic to (𝕊k−1,𝕊2⁢k−1). The genericity of x and y in f⁢(σ)∩f⁢(τ) is preserved through the subdivision T→T1 so the four complexes D∙,∙′ are k-dimensional balls and their bounding spheres have the same linking numbers in ∂Bx′ and ∂By′ as their counterparts on ∂Bx and ∂By.

Figure 2: The construction of B′.

Up to subdividing T1 into T2, there exist vertices vx′ and vy′ in ∂Bx′ and ∂By′, respectively, and a path P′ in the 1-skeleton of T2 from vx′ to vy′ such that, letting N⁢(P′) denote the closed star of P′ in T2, the closed star of N⁢(P′) is disjoint from the image of f. The union B′:=Bx′∪N⁢(P′)∪By′ is a ball. Observe that in ∂B′, the (k−1)-spheres ∂Dσ,x′ and ∂Dτ,x′ retain the linking number 1 that they have on ∂Bx′. Similarly, in ∂B′, the (k−1)-spheres ∂Dσ,y′ and ∂Dτ,y′ retain the linking number 1 that they have on ∂By′.

Figure 3: The path Pσ.

Thus, up to further subdividing T2 into T3, there exist a path Pσ in the 1-skeleton of ∂B′ that connects ∂Dσ,x′ to ∂Dσ,y′ and with relative interiors disjoint from the image of f. (Here we use that ∂Dα,z′ is of codimension k≥2 in ∂B′.) Up to subdividing the triangulation further, we can pipe Dσ,x and Dσ,y together by a tube Fσ found in a neighborhood of the path Pσ [32, §⁢5.10]. The tube (Fσ,Fσ∩Dσ,x,Fσ∩Dσ,y) is homeomorphic to (𝔻k×[0,1],𝔻k×{0},𝔻k×{1}). Moreover, by the (PL) general position theorem for embeddings [32, §5.3], we can take Fσ such that ∂B′ and ∂Fσ intersect in a generic way. By taking Fσ in a sufficiently small neighborhood U of Pσ so that (U,∂B′∩U) is homeomorphic to (ℝ2⁢k,ℝ2⁢k−1×{0}), and the triple (Fσ∩∂B′,Fσ∩Dσ,x∩∂B′,Fσ∩Dσ,y∩∂B′) is homeomorphic to (𝔻k−1×[0,1],𝔻k−1×{0},𝔻k−1×{1}).

Figure 4: The piping Fσ between Dσ,x and Dσ,y in a neighborhood of Pσ.

Now, let Cσ be the sum Dσ,x+∂Fσ+Dσ,y (over ℤ2). Note that Cσ is contained in the union of Bx∪By and the closed star of N⁢(P′), and therefore intersects the image of f only inside Bx∪By. We note that Fσ∩∂B′ also pipes the (k−1)-spheres Dσ,x∩∂B′ and Dσ,y∩∂B′. Indeed, (Fσ∩∂B′,Fσ∩Dσ,x∩∂B′,Fσ∩Dσ,y∩∂B′)=(Fσ∩∂B′,Fσ∩∂(Dσ,x∩B′), Fσ∩∂(Dσ,y∩B′)) is homeomorphic to (𝔻k−1×[0,1],𝔻k−1×{0},𝔻k−1×{1}). It follows that Cσ∩∂B′ is homeomorphic to the connected sum of two (k−1)-spheres, and is therefore homeomorphic to a (k−1)-sphere.

Figure 5: The chain Cσ=Dσ,x+∂Fσ+Dσ,y over ℤ2.

We claim that, in ∂B′, the linking number between Cσ∩∂B′ and Dτ,x∩∂B′ equals the linking number between Dσ,x∩∂B′ and Dτ,x∩∂B′, that is 1. This follows from the fact that the chain Cσ differs from Dσ,x by ∂Fσ+Dσ,y, and that each of ∂Fσ∩∂B′ and Dσ,y∩∂B′ is a boundary in ∂B′∖Dτ,x. The same claim holds if we exchange x for y.

Figure 6: The chain η∈Ck⁢(∂B′∖Cσ;ℤ2) such that ∂η=Dτ,x∩∂B′+Dτ,y∩∂B′ over ℤ2.

Altogether, we get that Dτ,x∩∂B′ and Dτ,y∩∂B′ are in the same homology class in ∂B′∖Cσ. Hence, their sum is a boundary, and there exists a chain η∈Ck⁢(∂B′∖Cσ;ℤ2) such that the support of ∂η is the sum over ℤ2 of Dτ,x∩∂B′ and Dτ,y∩∂B′. We finally set

f′⁢(σ)=f⁢(σ)+Dσ,x+Dσ,y⏟f⁢(σ)⁢ with its restriction to Bx∪By removed+Cσandf′⁢(τ)=f⁢(τ)+Dτ,x′+Dτ,y′⏟f⁢(τ)⁢ with its restriction to B′ removed+η
Figure 7: The chains Cσ and η reroute f⁢(σ) and f⁢(τ) so as to remove intersections in Bx and By.

We set f′⁢(ω)=f⁢(ω) for every other face ω∈K. Extending f′ linearly yields a chain map, since both f′⁢(σ)−f⁢(σ) and f′⁢(τ)−f⁢(τ) are cycles 222They are even boundaries, ensuring that f′ is chain homotopic to f. The chain map f′ is as announced: f′⁢(σ)∩f′⁢(τ)=f⁢(σ)∩f⁢(τ)∖{x,y} 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 k≥2, if ℳ is a compact, (k−1)-connected, (2⁢k−1)-dimensional PL manifold (possibly with boundary), then ℳ×[0,1] is a compact, (k−1)-connected, 2⁢k-dimensional PL manifold (possibly with boundary). Moreover, βk⁢(ℳ×[0,1];ℤ2)=βk⁢(ℳ;ℤ2) and any homological minor of ℳ is a homological minor of ℳ×[0,1]. If the statement holds for d even and b∈ℕ with some N⁢(b,d), then it holds with d−1 and b by putting N⁢(d−1,b):=N⁢(d,b). So let us now consider the even-dimensional case.

Let k≥2 and b∈ℕ, and let ℳ be a compact, (k−1)-connected, 2⁢k-dimensional PL manifold (possibly with boundary). Let us fix N and suppose that K=ΔN(k) is a homological minor of ℳ. By Lemma 8, there exist a triangulation T of ℳ and a (simplicial) homological almost-embedding C∗⁢(K)→C∗⁢(T). Actually, letting S:=T(k), we have that there exists a homological almost-embedding a:C∗⁢(K;ℤ2)→C∗⁢(S;ℤ2).

We apply Theorem 9 with L=S. Condition (i) holds with T=S and f the identity, so Condition (ii) also holds. Hence, there exists a triangulation R of ℝ2⁢k, a simplicial map g:S→R in general position, and a map α that sends each k-face of S to an element of Hk⁢(ℳ;ℤ2) such that any two non-adjacent k-faces σ,τ∈S intersect evenly if and only if ∩ℳ(α⁢(σ),α⁢(τ))=0. We let α~:Ck⁢(S)→Hk⁢(ℳ;ℤ2) denote the linear extension of α.

Consider the chain map b:C∗⁢(K;ℤ2)→C∗⁢(R;ℤ2) defined by b=g#∘a. Note that b is nontrivial since a is nontrivial and g is a simplicial map. Moreover, the fact that b is a chain map in general position follows from three observations:

  • ■

    since g is a simplicial map in general position, g# is a chain map in general position,

  • ■

    since a 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 N≥2⁢k+3, not every independent k-faces of K can have images under b that intersect evenly. Indeed Theorem 4 would then imply that K is a homological minor of ℝ2⁢k, 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 K.

So consider two non-adjacent k-faces σ,τ∈K and put a⁢(σ)=σ1+σ2+…+σs and a⁢(τ)=τ1+τ2+…+τt. Since a is a homological almost-embedding, supp⁡(a⁢(σ)) and supp⁡(a⁢(τ)) are disjoint, and σi and τj are thus non-adjacent for every (i,j)∈[s]×[t]. Hence, given (i,j)∈[s]×[t], g⁢(σi) and g⁢(τj) intersect evenly if and only if ∩ℳ(α⁢(σi),α⁢(τj))=0. We can thus count the intersections of b⁢(σ) and b⁢(τ) (the following equalities are modulo 2 and Card⁢() denotes the cardinal):

Card⁢(b⁢(σ)∩b⁢(τ))= ∑i∈[s],j∈[t]Card⁢(g⁢(σi)∩g⁢(τj))
= ∑i∈[s],j∈[t]∩ℳ(α⁢(σi),α⁢(τj))
= ∑i∈[s]∩ℳ(α⁢(σi),α~⁢(a⁢(τ)))=∩ℳ(α~⁢(a⁢(σ)),α~⁢(a⁢(τ))).

Let r=βk⁢(ℳ;ℤ2). The map β:Ck⁢(K)→Hk⁢(ℳ;ℤ2) defined by β=α~∘a induces a coloring of the k-simplices of K by the (at most 2r) elements of Hk⁢(M;ℤ2). Let N′ denote the number of vertices of sd⁡Δ2⁢k+2(k). By the hypergraph Ramsey theorem, for N large enough (as a function of r and k) there exists a subset W of N′ vertices in K such that β is constant over all k-simplices of K⁢[W]; let us denote by □ this constant value. In particular, for every k-faces σ,τ of K⁢[W] such that σ and τ are not adjacent, we have, modulo 2, Card⁢(b⁢(σ)∩b⁢(τ))=∩ℳ(β⁢(σ1),β⁢(τ1))=∩ℳ(□,□). Let us fix a bijection from the vertices of sd⁡Δ2⁢k+2(k) to W and extend it to a chain map j:C∗⁢(sd⁡Δ2⁢k+2(k))→C∗⁢(K⁢[W]). Also, let h:C∗⁢(Δ2⁢k+2(k))→C∗⁢(sd⁡Δ2⁢k+2(k)) denote the subdivision chain map, where each i-face of Δ2⁢k+2(k) is mapped to the sum of the i-faces of sd⁡Δ2⁢k+2(k) that it contains. In particular, for every k-face σ of Δ2⁢k+2(k), the chain h⁢(σ) is supported on k! k-faces of sd⁡Δ2⁢k+2(k).

Let us examine the properties of b∘j∘h. First, it is a nontrivial chain map (because b, j and h are). Moreover, j∘h is a homological almost-embedding (since j and h are), and its composition with the chain map in general position b yields a chain map in general position. Furthermore, any two non-adjacent k-faces σ,τ∈Δ2⁢k+2(k) have images under b∘j∘h that intersect evenly. To see this, let us put j∘h⁢(σ)=σ1+σ2+…+σs and j∘h⁢(τ)=τ1+τ2+…+τs. Since j∘h is a homological almost-embedding, supp⁡(j∘h⁢(σ)) and supp⁡(j∘h⁢(τ)) are disjoint. It follows that for every i,j∈[s] the k-simplices σi and τj are non-adjacent. We therefore have, modulo 2,

Card⁢(b∘j∘h⁢(σ)∩b∘j∘h⁢(τ)) =∑i,j∈[s]Card⁢(b⁢(σi)∩b⁢(τj))
=∑i,j∈[s]∩ℳ(β⁢(σi),β⁢(τj))=∑i,j∈[s]∩ℳ(□,□).

To sum up, the cardinal of b∘j∘h⁢(σ)∩b∘j∘h⁢(τ) has the same parity as ∩ℳ(□,□)⁢s2. Since s=k! is even, σ and τ have images under b∘j∘h that intersect evenly.

To conclude, b∘j∘h is a nontrivial chain map in general position from Δ2⁢k+2(k) to R such that independent faces have images that intersect evenly. By Theorem 4 this means that Δ2⁢k+2(k) is a homological minor of ℝ2⁢k, a contradiction with Theorem 2. Thus, for N large enough, the initial hypothesis that ΔN(k) 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):

∀t∈ℕ,hℱ⁡(t)=supℱ′⊂ℱ|ℱ′|≤thℱ′≤supℱ′⊂ℱ|ℱ′|≤t(rℱ′−1)=rℱ⁡(t)−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 t0∈ℕ. If hℱ⁡(t)<t for all t>t0, then hℱ≤t0.

Proof.

By definition, we have hℱ⁡(t)≤t for every t∈ℕ. Moreover, hℱ⁡(t)≠hℱ⁡(t−1) if and only if hℱ⁡(t)=t. The assumption and a straightforward induction therefore implies that for every t>t0 we have hℱ⁡(t)=hℱ⁡(t0)≤t0. ◀ The growth of graded Radon numbers is at most linear [2, App. D] and rather constrained:

Lemma 11.

Let ℱ be a set system and t≥2 an integer. If rℱ⁡(t)>rℱ⁡(t−1), then rℱ⁡(t−1)≥1+log2⁡(1+thℱ⁡(t)).

Proof.

Let X denote the ground set of ℱ and let n=rℱ⁡(t−1). Suppose that rℱ⁡(t)>n, so that there exist a subset 𝒢={G1,G2,…,Gt}⊂ℱ and a subset S⊆X of size n such that

  1. (i)

    there is no partition of S into two parts whose 𝒢-convex hulls intersect,

  2. (ii)

    for every i∈[t], there exists a partition 𝒫i of S into two parts whose (𝒢∖{Gi})-convex hulls intersect.

Recall that given ℱ′⊆ℱ, the ℱ′-convex hull convℱ′⁡(P) of a subset P⊂X is the intersection of all the members of ℱ′ that contain P. In particular, for any P⊆X such that P⊈Gi we have conv𝒢⁡(P)=conv𝒢∖{Gi}⁡(P). Conditions (i) and (ii) therefore imply that every Gi∈𝒢 contains one or the other part of 𝒫i.

There are at most 2n−1−1 partitions of S in two nonempty parts. Let us assume that t>(2n−1−1)⁢h for some integer h, so that by the pigeonhole principle there exist h+1 indices i1,i2,…,ih+1 such that the partitions 𝒫i1,𝒫i2, …, 𝒫ih+1 coincide. Let {P1,P2} be that partition of S. Let us put 𝒢′={A∈𝒢:P1⊆A⁢ or ⁢P2⊆A}. We make two observations:

  • ■

    ∩A∈𝒢′A coincides with conv𝒢⁡(P1)∩conv𝒢⁡(P2) and is therefore empty.

  • ■

    every choice of h elements in 𝒢′ has nonempty intersection. Indeed, 𝒢′ contains Gi1, Gi2, …, Gih+1, so that any choice of h elements from 𝒢′ is bound to miss Gij for at least one j∈[h+1] and their intersection must then contain conv𝒢∖{Gij}⁡(P1)∩conv𝒢∖{Gij}⁡(P2)≠∅.

For h≥hℱ⁡(t) these conditions are incompatible. We therefore have t≤(2n−1−1)⁢hℱ⁡(t), 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 hℱ is also infinite, then by Lemma 10 there exists an increasing sequence {ti}i∈ℕ such that hℱ⁡(ti)=ti, and therefore rℱ⁡(ti)≥ti+1 by Inequality (4); this prevents rℱ⁡(t)−log2⁡t from going to −∞ as t→∞. So suppose that the Helly number hℱ is finite. The assumption that rℱ=∞ ensures that there exists an increasing sequence {ti}i∈ℕ such that rℱ⁡(ti)>rℱ⁡(ti−1). Lemma 11 implies that rℱ⁡(ti)>rℱ⁡(ti−1)≥log2⁡ti−log2⁡hℱ. Again, this prevents rℱ⁡(t)−log2⁡t from going to −∞ as t→∞. 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 K there exists a function SK:ℕ→ℕ with limt→∞SK⁢(t)=+∞ such that the following holds. Any set system ℱ whose ground set has K as forbidden homological minor and satisfies ϕℱ(dimK)⁢(t)≤SK⁢(t) for t large enough has finite Radon number.

Proof.

Recall that Ψhc→r(K)⁢(x) denotes the supremum of the Radon number of a set system with (dimK)-level topological complexity at most x and whose ground set has K as forbidden homological minor. Patáková [28] proved that Ψhc→r(K)⁢(x) is finite for every K and x.

For t∈ℕ, we define SK⁢(t)=max⁡{x∈ℕ∣Ψhc→r(K)⁢(x)≤12⁢log2⁡t}. This ensures that Ψhc→r(K)⁢(SK⁢(t))≤12⁢log2⁡t for every t∈ℕ. Observe that limt→∞SK⁢(t)=∞ since Ψhc→r(K)⁢(x) is finite for every x∈ℕ.

Now consider a set system ℱ with function ϕℱ(dimK)≤SK and whose ground set has K as forbidden homological minor. Let t∈ℕ and consider a subset ℱ′⊆ℱ of size t. The ground set of ℱ′ also has K as forbidden homological minor. Moreover, ℱ′ has (dimK)-level topological complexity at most ϕℱ(dimK)⁢(t)≤SK⁢(t). It follows that rℱ′≤Ψhc→r(K)⁢(SK⁢(t))≤12⁢log2⁡t. This holds for every ℱ′⊆ℱ of size t, so rℱ⁡(t)≤12⁢log2⁡t. This inequality holds for every t∈ℕ 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 Ψr→fh⁢(y) denotes the supremum of the fractional Helly number of a set system with Radon number y. Holmsen and Lee [17, Theorem 1.1] proved that Ψr→fh⁢(y) is finite for every y. Let SK denote the function from Corollary 12. Now consider a set system ℱ whose ground set has K as forbidden homological minor and satisfies ϕℱ(dimK)≤SK. Corollary 12 ensures that rℱ, the Radon number of ℱ, is finite. It follows that the fractional Helly number of ℱ is at most Ψr→fh⁢(rℱ), and is therefore finite. From there, [13, Theorem 1.2] ensures that this fractional Helly number is at most μ⁢(K)+1. ◀

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 chℱ of ℱ is the smallest number of colors m such that for every coloring of a subfamily ℱ′⊂ℱ with m 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 c-wise clique if every c-element subset of 𝒢 is a clique. Clearly a clique is a c-wise clique, and when c≥hℱ 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 c-wise cliques:

  • ■

    The cth colorful Helly number chℱ(c) of ℱ is the smallest number of colors m≥c such that for every coloring of a subfamily ℱ′⊂ℱ with m colors, if every subfamily of ℱ′ that contains exactly one element of each color forms a c-wise clique, then at least one color class is a c-wise clique.

  • ■

    The cth fractional Helly number fhℱ(c) of ℱ is the smallest integer s such that there exists a function βℱ:(0,1)→(0,1) with the following property: For every finite subfamily ℱ′⊂ℱ, whenever a fraction α of the s-tuples of ℱ′ forms a c-wise clique, a subset 𝒢 of ℱ′ of size βℱ⁢(α)⁢|ℱ′| forms a c-wise clique.

Obviously for every set system ℱ, if c≥hℱ, then fhℱ(c)=fhℱ and chℱ(c)=chℱ. Holmsen [16, Theorem 1.2] proved that fhℱ(c)≤chℱ(c) for every set system ℱ and every c∈ℕ. A close inspection of that proof provides another bridge between the graded and ungraded parameters:

Lemma 13.

Let ℓ>c be integers. Every set system ℱ such that chℱ(c)⁡(c⁢ℓ)≤ℓ satisfies fhℱ(c)≤chℱ(c)⁡(c⁢ℓ).

Proof.

Let c<ℓ, let ℱ be a set system and let ℓ′:=chℱ(c)⁡(c⁢ℓ). By definition of chℱ(c)⁡(⋅), the c-uniform hypergraph recording which c-element subsets of ℱ form cliques cannot contain a certain pattern on c⁢ℓ′ vertices, namely the complete ℓ′-tuples of missing edges [17, §⁢3]. This is the only property needed to ensure that fhℱ(c)≤ℓ′ [16, Theorem 1.2]. ◀

Let Ψr→ch(c)⁢(x) denote the supremum of the cth colorful Helly number of a set system with Radon number x. Holmsen and Lee [17, Theorem 2.2] proved that Ψr→ch(c)⁢(x)≤max⁡(Ξ⁢(x),c) for every c≥x−1, where Ξ:ℕ→ℕ is the function defined by Ξ⁢(r):=rr⌈log2⁡r⌉+r⁢⌈log2⁡r⌉. Applying this inequality to subsets of size t we get:

chℱ(c)⁡(t)≤max⁡(Ξ⁢(rℱ⁡(t)),c) for every ⁢ℱ,c,t⁢ such that ⁢c≥hℱ⁡(t). (5)
Proof of Theorem 7.

Let Ψ:ℕ→ℕ and t0∈ℕ such that Ψ⁢(t)<t+1 for every t≥t0. Also suppose that there exists an integer t1≥t02 such that Ξ⁢(Ψ⁢(t1))<t1t0. We now consider a set system ℱ such that rℱ⁡(t)≤Ψ⁢(t) for every t∈ℕ and argue that fhℱ, the fractional Helly number of ℱ, is bounded.

By Levi’s inequality (4) we have hℱ⁡(t)≤rℱ⁡(t)−1≤Ψ⁢(t)−1. It follows that hℱ⁡(t)<t for every t≥t0, so by Lemma 10 we have hℱ≤t0. Hence, the graded version (5) of the Holmsen-Lee inequality applies with c=t0 and every t, that is chℱ(t0)⁡(t)≤max⁡(Ξ⁢(Ψ⁢(t)),t0).

Let us apply Lemma 13 with c=t0 and ℓ=t1t0. Observe that ℓ>c holds because t1>t02, and that chℱ(c)⁡(c⁢ℓ)≤ℓ follows from the assumption that Ξ⁢(Ψ⁢(t1))≤t1t0, as

chℱ(c)⁡(c⁢ℓ)=chℱ(t0)⁡(t1)≤max⁡(Ξ⁢(Ψ⁢(t1)),t0)≤t1t0=ℓ.

Hence, fhℱ(t0)≤chℱ(t0)⁡(t1). Since hℱ≤t0 we have fhℱ(t0)=fhℱ 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 ℝn. 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 k-complexes in 2⁢k-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.