Related papers: Matroid colorings of KKM covers

Recently Sober\'on proved a far-reaching generalization of the colorful KKM Theorem due to Gale: let $n\geq k$, and assume that a family of closed sets $(A^i_j\mid i\in [n], j\in [k])$ has the property that for every $I\in…

A coloring of a matroid is proper if elements of the same color form an independent set. A theorem of Seymour asserts that a k-colorable matroid is also colorable from any lists of size k. In this note we generalize this theorem to the…

A coloring of a matroid is an assignment of colors to the elements of its ground set. We restrict to proper colorings - those for which elements of the same color form an independent set. Seymour proved that a $k$-colorable matroid is also…

We consider generalizations of Gale's colored KKM lemma and Shapley's KKMS theorem. It is shown that spaces and covers can be much more general and the boundary KKM rules can be substituted by more weaker boundary assumptions.

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…

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…

Following and developing ideas of R. Karasev (Covering dimension using toric varieties, arXiv:1307.3437), we extend the Lebesgue theorem (on covers of cubes) and the Knaster-Kuratowski-Mazurkiewicz theorem (on covers of simplices) to…

The aim of this work is to explicitly compute the K-theory of the category of matroids with respect to the covering family of Tutte coverings. In particular, we show that this is equivalent to the K-theory spectrum of the category of…

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…

We prove a common extension of Bang's and Kadets' lemmas for contact pairs, in the spirit of the Colourful Carath\'eodory Theorem. We also formulate a generalized version of the affine plank problem and prove it under special assumptions.…

We give Henneberg-type constructions for three families of sparse colored graphs arising in the rigidity theory of periodic and other forced symmetric frameworks. The proof method, which works with Laman-sparse finite covers of colored…

We show that if $P$ is a lattice polytope in the nonnegative orthant of $\R^k$ and $\chi$ is a coloring of the lattice points in the orthant such that the color $\chi(a+b)$ depends only on the colors $\chi(a)$ and $\chi(b)$, then the number…

Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of electrical circuits and in the evaluation of…

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…

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…

It is known that in matroids the difference between the chromatic number and the fractional chromatic number is smaller than 1, and that the list chromatic number is equal to the chromatic number. We investigate the gap within these pairs…

We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag varieties. We introduce two different generalizations, and demonstrate that each has its own merits, where the trade-off is between the ease…

In this work methods of construction of cubic graphs are analyzed and a theorem of existence of a colored disc traversing each pair of linked edges belonging to an elementary cycle of a planar cubic graph is proved.

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…

The Packing/Covering Conjecture was introduced by Bowler and Carmesin motivated by the Matroid Partition Theorem by Edmonds and Fulkerson. A packing for a family $ (M_i: i\in\Theta) $ of matroids on the common edge set $ E $ is a system $…