English
Related papers

Related papers: Colorful circuits and colorful topes in oriented m…

200 papers

B\'ar\'any's colorful generalization of Carath\'eodory's Theorem combines geometrical and combinatorial constraints. Kalai-Meshulam (2005) and Holmsen (2016) generalized B\'ar\'any's theorem by replacing color classes with matroid…

Combinatorics · Mathematics 2019-12-25 Georg Loho , Raman Sanyal

Carath\'eodorys Theorem of convex hulls plays an important role in convex geometry. In 1982, B\'ar\'any formulated and proved a more general version, called the Colorful Carath\'eodory. This colorful version was even more generalized by…

Combinatorics · Mathematics 2019-04-29 Helena Bergold , Winfried Hochstättler

We prove two colorful Carath\'eodory theorems for strongly convex hulls, generalizing the colorful Carat\'eodory theorem for ordinary convexity by Imre B\'ar\'any, the non-colorful Carath\'eodory theorem for strongly convex hulls by the…

Combinatorics · Mathematics 2017-03-21 Andreas F. Holmsen , Roman Karasev

We develop a topological framework in an attempt to generalize the classical colourful Caratheodory theorem by imposing an additional constraint. For that we introduce the notion of zero-avoding complexes and covering criteria for the…

Algebraic Topology · Mathematics 2025-12-30 Pavle V. M. Blagojevic

We give the following extension of Barany's colorful Caratheodory theorem: Let M be an oriented matroid and N a matroid with rank function r, both defined on the same ground set V and satisfying rank(M) < rank(N). If every subset A of V…

Combinatorics · Mathematics 2013-09-03 Andreas Holmsen

Let $C_1,...,C_{d+1}$ be $d+1$ point sets in $\mathbb{R}^d$, each containing the origin in its convex hull. A subset $C$ of $\bigcup_{i=1}^{d+1} C_i$ is called a colorful choice (or rainbow) for $C_1, \dots, C_{d+1}$, if it contains exactly…

Computational Geometry · Computer Science 2016-08-08 Frédéric Meunier , Wolfgang Mulzer , Pauline Sarrabezolles , Yannik Stein

A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented…

Combinatorics · Mathematics 2023-09-20 Hery Randriamaro

Building on a recent characterization of tope graphs of Complexes of Oriented Matroids (COMs), we tackle and generalize several classical problems in Oriented Matroids (OMs), Lopsided Sets (aka ample set systems), and partial cubes via…

Combinatorics · Mathematics 2023-03-14 Kolja Knauer , Tilen Marc

Given $d+1$ sets, or colours, $S_1, S_2,...,S_{d+1}$ of points in $\mathbb{R}^d$, a {\em colourful} set is a set $S\subseteq\bigcup_i S_i$ such that $|S\cap S_i|\leq 1$ for $i=1,...,d+1$. The convex hull of a colourful set $S$ is called a…

Computational Geometry · Computer Science 2014-03-07 Frédéric Meunier , Antoine Deza

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

Combinatorics · Mathematics 2017-04-04 Meysam Alishahi , Hossein Hajiabolhassan , Frédéric Meunier

Let $C_1,\dots,C_{d+1}\subset \mathbb{R}^d$ be $d+1$ point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $p_1, \dots, p_{d+1}$ with $p_i \in C_i$, for $i = 1, \dots, d+1$, a…

Computational Geometry · Computer Science 2018-08-31 Wolfgang Mulzer , Yannik Stein

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

Combinatorics · Mathematics 2024-02-14 Balázs Keszegh

Las Vergnas and Hamidoune studied the number of circuits needed to determine an oriented matroid. In this paper we investigate this problem and some new variants, as well as their interpretation in particular classes of matroids. We present…

Combinatorics · Mathematics 2016-07-18 Kolja Knauer , Luis Pedro Montejano , Jorge Luis Ramírez Alfonsín

We prove a KKM-type theorem for matroid colored families of set coverings of a polytope. This generalizes Gale's colorful KKM theorem as well as recent sparse-colorful variants by Sober\'on, and McGinnis and Zerbib.

Combinatorics · Mathematics 2024-11-01 Daniel McGinnis

We prove a common strengthening of B\'ar\'any's colorful Carath\'eodory theorem and the KKMS theorem. In fact, our main result is a colorful polytopal KKMS theorem, which extends a colorful KKMS theorem due to Shih and Lee [Math. Ann. 296…

Combinatorics · Mathematics 2020-11-11 Florian Frick , Shira Zerbib

The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…

Combinatorics · Mathematics 2015-03-19 Matthew T. Stamps

In 1967 Herbert Scarf suggested a new proof of Brouwer fixed point theorem based on a surprising analogue of Sperner's lemma. This analogue was motivated by Scarf's work in game theory and mathematical economics. Moreover, Scarf proved a…

Combinatorics · Mathematics 2022-07-25 Nikolai V. Ivanov

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

In this paper, we use the Carath\'eodory Convergence Theory to prove a landing theorem of rays in hyperbolic components with rational arguments. Although the proof is done in the setting of a family of entire transcendental maps with two…

Dynamical Systems · Mathematics 2014-06-23 Aslı Deniz

Let $M_1,M_2,\ldots,M_k$ be a collection of matroids on the same ground set $E$. A coloring $c:E \rightarrow \{1,2,\ldots,k\}$ is called \emph{cooperative} if for every color $j$, the set of elements in color $j$ is independent in $M_j$. We…

Combinatorics · Mathematics 2023-03-16 Tomasz Bartnicki , Sebastian Czerwiński , Jarosław Grytczuk , Zofia Miechowicz
‹ Prev 1 2 3 10 Next ›