English
Related papers

Related papers: On colorful generalizations of the Goodman--Pollac…

200 papers

We solve a long-standing open problem posed by Goodman \& Pollack in 1988 by establishing a necessary and sufficient condition for a family of convex sets in $\mathbb{R}^d$ to admit a $k$-transversal for any $0 \le k \le d-1$. This result…

Combinatorics · Mathematics 2026-01-26 Daniel McGinnis , Nikola Sadovek

Hadwiger's transversal theorem gives necessary and sufficient conditions for a family of convex sets in the plane to have a line transversal. A higher dimensional version was obtained by Goodman, Pollack and Wenger, and recently a colorful…

Metric Geometry · Mathematics 2013-10-17 Andreas F. Holmsen , Edgardo Roldán-Pensado

Hadwiger's transversal theorem gives necessary and sufficient conditions for the existence of a line transversal to a family of pairwise disjoint convex sets in the plane. These conditions were subsequently generalized to hyperplane…

Combinatorics · Mathematics 2024-09-06 Andreas F. Holmsen

We prove a colorful generalization of the Borsuk--Ulam theorem and derive colorful consequences from it, such as a colorful generalization of the ham sandwich theorem. Even in the uncolored case this specializes to a strengthening of the…

Combinatorics · Mathematics 2023-09-27 Florian Frick , Zoe Wellner

Let $\mathcal{F}$ be a family of convex sets in ${\mathbb R}^d$, which are colored with $d+1$ colors. We say that $\mathcal{F}$ satisfies the Colorful Helly Property if every rainbow selection of $d+1$ sets, one set from each color class,…

Combinatorics · Mathematics 2018-03-28 Leonardo Martínez-Sandoval , Edgardo Roldán-Pensado , Natan Rubin

The colorful Helly theorem and Tverberg's theorem are fundamental results in discrete geometry. We prove a theorem which interpolates between the two. In particular, we show the following for any integers $d \geq m \geq 1$ and $k$ a prime…

Combinatorics · Mathematics 2024-03-25 Michael Gene Dobbins , Andreas F. Holmsen , Dohyeon Lee

We prove the following optimal colorful Tverberg-Vrecica type transversal theorem: For prime r and for any k+1 colored collections of points C^l of size |C^l|=(r-1)(d-k+1)+1 in R^d, where each C^l is a union of subsets (color classes) C_i^l…

Algebraic Topology · Mathematics 2022-03-25 Pavle Blagojevic , Benjamin Matschke , Gunter Ziegler

Let $\mathcal F$ be a family of compact convex sets in $\mathbb R^d$. We say that $\mathcal F $ has a \emph{topological $\rho$-transversal of index $(m,k)$} ($\rho<m$, $0<k\leq d-m$) if there are, homologically, as many transversal…

Combinatorics · Mathematics 2011-07-06 L. Montejano , R. N. Karasev

We provide a short proof of a conic version of the colorful Carath\'eodory theorem for oriented matroids. Holmsen's extension of the colorful Carath\'eodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses…

Combinatorics · Mathematics 2025-09-26 Minho Cho , Seunghun Lee , Frédéric Meunier

We present extensions of the Colorful Helly Theorem for $d$-collapsible and $d$-Leray complexes, providing a common generalization to the matroidal versions of the theorem due to Kalai and Meshulam, the ``very colorful" Helly theorem…

Combinatorics · Mathematics 2023-05-23 Minki Kim , Alan Lew

Two celebrated extensions of the classical Helly's theorem are the fractional Helly theorem and the colorful Helly theorem. Bulavka, Goodarzi, and Tancer recently established the optimal bound for the unified generalization of the…

Combinatorics · Mathematics 2024-08-28 Debsoumya Chakraborti , Minho Cho , Jinha Kim , Minki Kim

We prove extensions of Halman's discrete Helly theorem for axis-parallel boxes in $\mathbb{R}^d$. Halman's theorem says that, given a set $S$ in $\mathbb{R}^d$, if $F$ is a finite family of axis-parallel boxes such that the intersection of…

Combinatorics · Mathematics 2024-04-23 Timothy Edwards , Pablo Soberón

We show that the map from $K({\mathbb S})$ to its chromatic completion is a connective cover and identify the fiber in $K$-theoretic terms. We combine this with recent work of Land-Mathew-Meier-Tamme to prove a form of "Waldhausen's…

K-Theory and Homology · Mathematics 2026-01-09 Andrew J. Blumberg , Michael A. Mandell , Allen Yuan

In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…

Combinatorics · Mathematics 2024-11-12 Krystal Guo , Ross J. Kang , Gabriëlle Zwaneveld

Helly's theorem is a classical result concerning the intersection patterns of convex sets in $\mathbb{R}^d$. Two important generalizations are the colorful version and the fractional version. Recently, B\'{a}r\'{a}ny et al. combined the…

Combinatorics · Mathematics 2019-07-04 Minki Kim

One widely applied sufficient condition for the existence of a colorful simplex in a vertex-colored simplicial complex is a topological extension of Hall's transversal theorem due to Aharoni, Haxell, and Meshulam. We prove a similar…

Combinatorics · Mathematics 2025-11-10 Ronen Wdowinski

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

A \textit{$k$-transversal} to family of sets in $\mathbb{R}^d$ is a $k$-dimensional affine subspace that intersects each set of the family. In 1957 Hadwiger provided a necessary and sufficient condition for a family of pairwise disjoint,…

Combinatorics · Mathematics 2024-01-19 Daniel McGinnis

Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours.…

Combinatorics · Mathematics 2009-03-12 L. M. Pretorius , K. J. Swanepoel

The long-standing Erd\H{o}s-Faber-Lov\'asz conjecture states that every $n$-uniform linear hypergaph with $n$ edges has a proper vertex-coloring using $n$ colors. In this paper we propose an algebraic framework to the problem and formulate…

Combinatorics · Mathematics 2021-05-18 Oliver Janzer , Zoltán Lóránt Nagy
‹ Prev 1 2 3 10 Next ›