Search arXivSearch

arXiv · 2607.06172

Cone and constrained colorful Carathéodory Theorems

Abstract

Holmsen proved in 2016 a generalization of the classical colorful Caratheodory theorem in which a matroid imposes additional constraints on the desired colorful transversal. His approach also works in the more general setting of oriented matroids, rather than relying directly on convex hulls. In this paper, we extend these ideas in several directions. First, we study which colorful Caratheodory-type results remain valid when convex cones replace convex hulls, as well as analogous modifications in the oriented matroid setting. Second, we consider variants in which the additional constraint on the transversal is not encoded by a matroid. This leads to new extensions of the classical Tverberg theorem. Our approach is topological, following the methods of Holmsen, and Kalai and Meshulam, on which it builds. The key idea is to analyze homology groups of simplicial complexes that encode colorful Caratheodory-type phenomena, such as the support complex of an oriented matroid. In particular, one shows that these complexes are (near-)d-Leray. We extend this analysis by carrying out more detailed homology computations for these complexes, with the aim of enabling further and more refined applications of the method.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pavle V. M. Blagojević, Roman N. Karasev, Bálint Zsigri. 2026-07-07. Cone and constrained colorful Carathéodory Theorems. https://arxiv.org/abs/2607.06172

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO