Matroid polytopes with small rank
Abstract
For a lattice polytope P, the rank of P is defined by F-( P+1), where F is the number of facets of P. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes and graphic matroid base polytopes with rank at most three. Furthermore, using this characterization, we investigate their relationships with order polytopes, stable set polytopes, and edge polytopes.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.