Year: 2005
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Cordovil, Raul
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1663889609