Kalai orientations on matroid polytopes
Combinatorics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0504326,
title = {Kalai orientations on matroid polytopes},
author = {Raul Cordovil},
journal= {arXiv preprint arXiv:math/0504326},
year = {2007}
}
Comments
6 pages