Search arXivSearch

arXiv · 2412.01445

The fractional Helly number for separable convexity spaces

Abstract

A convex lattice set in $\mathbb{Z}^d$ is the intersection of a convex set in $\mathbb{R}^d$ with the integer lattice $\mathbb{Z}^d$. A classical theorem of Doignon states that the Helly number of $d$-dimensional convex lattice sets equals $2^d$, exponentially larger than the Helly number $d+1$ of ordinary convex sets in $\mathbb{R}^d$. By contrast, a remarkable theorem of Bárány and Matousek states that the fractional Helly number of convex lattice sets drops back down to $d+1$, matching the classical fractional Helly theorem of Katchalski and Liu. In this paper we generalize the Bárány--Matousek theorem to abstract convexity spaces (in the sense of van de Vel) that satisfy a suitable separation axiom. Our main result implies the following: if a separable convexity space has Radon number at most $r$, then its fractional Helly number is at most $2^{r}$. This bound is nearly tight, as illustrated by the case of box convexity in $\mathbb{R}^d$, whose Radon number is $Θ(\log d)$ and fractional Helly number equals $d+1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas F. Holmsen, Zuzana Patáková. 2026-07-19. The fractional Helly number for separable convexity spaces. https://arxiv.org/abs/2412.01445

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO