Search arXivSearch

arXiv · 2509.13115

New Helly-type results for discrete boxes: Quantitative colorful and $(p,q)$-variants

Abstract

In 2008, Halman showed that for any finite set $P\subset \mathbb R^d$ and any finite family $\mathcal{B}$ of axis-parallel boxes in $\mathbb{R}^d$, if the intersection of $P$ and any subfamily $\mathcal{B}' \subseteq\mathcal{B}$ of size at most $2d$ is non-empty, then the intersection of $P$ and $\mathcal{B}$ is also non-empty. Very recently Edwards and Soberón initiated the study of quantitative colorful version for $2d$ families, $(p,q)$-type variation for $p\geq q\geq d+1$, and other extensions of this Helly-type result by Halman. In this paper, we study the quantitative colorful Halman problem for $2d-1$ families as well its $(p,q)$-type variation for $p\geq q\geq 2$. Specifically, our main result asserts that for any finite set $P$ and finite families of boxes $\mathcal{B}_1,\dots,\mathcal{B}_{2d-1}$ in $\mathbb R^d$, where $d\geq 2$, if every transversal $\mathcal{B}$ for the families has an intersection $\bigcap \mathcal{B}$ containing at least $n$ points of $P$, then there exist $j\in[2d-1]$ and a subset of $P$ of size at most \[ 2n+\Big\lfloor \frac{n-1}{d \cdot 2^{d-1}} \Big\rfloor, \] such that each box of $\mathcal{B}_j$ contains at least $n$ points of this subset.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rahul Gangopadhyay, Alexander Polyanskii, Wei Rao. 2025-09-16. New Helly-type results for discrete boxes: Quantitative colorful and $(p,q)$-variants. https://arxiv.org/abs/2509.13115

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