arXiv (All)
open access
The topological Bárány-Larman conjecture for prime numbers
The Bárány-Larman conjecture states that for any $d+1$ sets of $r$ points each in $\mathbb{R}^d$, considered as color classes, we can partition their union into $r$ rainbow $(d+1)$-tuples whose convex hulls intersect. We prove that the topological version of this conjecture holds when $r$ is a prime
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#819399
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#809406
- Overlap-Helly theorems#996821
- Large Planar Point Sets Contain 4 Collinear Points or Almost 7-Cliques, and Related Results#1062998
- On colorful Helly numbers and the growth of Tverberg numbers#1014791
Record · ID 1142183
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive