The intersection of a matroid and an oriented matroid
From MaRDI portal
Publication:908055
DOI10.1016/j.aim.2015.11.040zbMath1329.05058OpenAlexW2199773171MaRDI QIDQ908055
Publication date: 2 February 2016
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2015.11.040
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Leray numbers of complexes of graphs with bounded matching number, Fair distributions for more participants than allocations, Topological drawings meet classical theorems from convex geometry, Tropical Carathéodory with matroids, A sparse colorful polytopal KKM theorem, Colorful theorems for strong convexity, Robust Tverberg and Colourful Carathéodory Results via Random Choice, Tverberg’s theorem is 50 years old: A survey, Cooperative conditions for the existence of rainbow matchings, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Topology of geometric joins, Topological Drawings Meet Classical Theorems from Convex Geometry
Cites Work
- Unnamed Item
- Unnamed Item
- A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
- Carathéodory-type theorems à la Bárány
- A topological colorful Helly theorem
- On Gromov's method of selecting heavily covered points
- The acyclic sets of an oriented matroid
- Intersections of Leray complexes and regularity of monomial ideals
- The colourful feasibility problem
- Note: Combinatorial Alexander duality -- a short and elementary proof
- Points surrounding the origin
- A generalization of Caratheodory's theorem
- Domination numbers and homology
- Colorful linear programming, Nash equilibrium, and pivots
- Tverberg's theorem via number fields
- Very colorful theorems
- Helly numbers of acyclic families
- Colourful Linear Programming and its Relatives
- Oriented Matroids
