Kalai orientations on matroid polytopes
Abstract
Let P a polytope and let G(P) be the graph of P. Following Gil Kalai, we say that an acyclic orientation O of G(P) is good if, for every non-empty face F of P, the induced graph G(F) has exactly one sink. Gil Kalai gave a simple way to tell a simple polytope from the good orientations of its graph. This article is a broader study of ``good orientations'' (of the graphs) on matroid polytopes.
- Publication:
-
arXiv Mathematics e-prints
- Pub Date:
- April 2005
- DOI:
- 10.48550/arXiv.math/0504326
- arXiv:
- arXiv:math/0504326
- Bibcode:
- 2005math......4326C
- Keywords:
-
- Combinatorics;
- 05B35
- E-Print:
- 6 pages