Mathematics – Combinatorics
Scientific paper
2005-04-15
Mathematics
Combinatorics
6 pages
Scientific paper
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.
No associations
LandOfFree
Kalai orientations on matroid polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Kalai orientations on matroid polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kalai orientations on matroid polytopes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-402107