Matroids, intersecting bases, and Borsuk property
Preprint
Abstract
A subset $S$ of $\mathbb R^d$ has the Borsuk property if it can be decomposed into at most $d+1$ parts of diameter smaller than $S$. This is an important geometric property, inspired by a conjecture of Borsuk from the 1930s, which has attracted considerable attention over the years. In this paper, we define and investigate the Borsuk property for matroids, providing a purely combinatorial approach to the Borsuk property for matroid polytopes, a well-studied family of $(0,1)$-polytopes associated with matroids. We show that a sufficient condition for a matroid -- and thus its matroid polytope -- to have the Borsuk property is that the matroid or its dual has two disjoint bases. However, we show that this condition is not necessary by exhibiting infinite families of matroids having the Borsuk property and yet being such that every two bases intersect and every two cobases intersect. Kneser graphs, which form an important object from topological combinatorics, play a crucial role in most proofs.
Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- On chromatic number and minimum cutJournal of Combinatorial Theory, Series B, 2019
- Lattice path matroids: enumerative aspects and Tutte polynomialsJournal of Combinatorial Theory, Series A, 2003
- Excursions into Combinatorial Geometry1997
- A counterexample to Borsuk’s conjectureBulletin of the American Mathematical Society, 1993
- On the chromatic number of cube-like graphsDiscrete Mathematics, 1992
- Kneser's conjecture, chromatic number, and homotopyJournal of Combinatorial Theory, Series A, 1978