تقرير
Intersections of matroids
| العنوان: | Intersections of matroids |
|---|---|
| المؤلفون: | Aharoni, Ron, Berger, Eli, Guo, He, Kotlar, Dani |
| سنة النشر: | 2024 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Combinatorics, Mathematics - Algebraic Topology, 05B35, 05C15, 05C10, 57M15, 52B40, 05C70, 90C27, 05C72 |
| الوصف: | We study simplicial complexes (hypergraphs closed under taking subsets) that are the intersection of a given number k of matroids. We prove bounds on their chromatic numbers (the minimum number of edges required to cover the ground set) and their list chromatic numbers. Settling a conjecture of Kiraly and Berczi et. al., we prove that the list chromatic number is at most k times the chromatic number. Following the footsteps of Edmonds, who considered the case k=2, we study three polytopes associated with k-tuples of matroids, and prove bounds on the distances between them. The tools used are in part topological. Comment: 35 pages |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2407.08789 |
| رقم الأكسشن: | edsarx.2407.08789 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |