Abstract
The Mihalisin–Klee Theorem states that an orientation of a 3-polytopal graph is induced by an affine function on some 3-polytope realizing the graph if the orientation is acyclic, has a unique source and a unique sink, and admits three independent monotone paths from the source to the sink. We replace the requirement that the orientation is acyclic with the assumption that it has no directed cycle contained in a face of the orientation, and show that such orientations are induced by 3-dimensional fans.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barnette, D.: Graph theorems for manifolds. Isr. J. Math. 16, 62–72 (1973)
Barnette, D., Grünbaum, B.: On Steinitz’s Theorem Concerning Convex 3-polytopes and on Some Properties of 3-connected graphs, The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol. 110, pp. 27–40. Springer, Berlin (1969)
Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids. Encyclopedia of Mathematics and Its Applications, vol. 46, 2nd edn. Cambridge University Press, Cambridge (1999)
Ewald, G.: Combinatorial Convexity and Algebraic Geometry. Springer, Berlin (1996)
Fukuda, K., Moriyama, S., Okamoto, Y.: The Holt–Klee condition for oriented matroids. Eur. J. Comb. 30, 1854–1867 (2009)
Gärtner, B., Morris, W., Rüst, L.: Unique sink orientations of grids. Algorithmica 51, 200–235 (2008)
Holt, F., Klee, V.: A proof of the strict monotone 4-step conjecture. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol. 223, pp. 201–216. American Mathematical Society, Providence, RI (1999)
Kaibel, V., Mechtel, R., Sharir, M., Ziegler, G.M.: The simplex algorithm in dimension three. SIAM J. Comput. 34, 475–497 (2005)
Klaus, L., Miyata, H.: Enumeration of PLCP-orientations of the 4-cube. Eur. J. Comb. 50, 138–151 (2015)
Kleinschmidt, P., Onn, S.: Signable posets and partitionable simplicial complexes. Discrete Comput. Geom. 15, 443–466 (1996)
Mihalisin, J., Klee, V.: Convex and linear orientations of polytopal digraphs. Discrete Comput. Geom. 24, 421–435 (2000)
Megiddo, N., Papadimitriou, C.H.: On total functions, existence theorems and computational complexity. Theor. Comput. Sci. 81, 317–324 (1991)
Pfeifle, J., Ziegler, G.: On the monotone upper bound problem. Exp. Math. 13, 1–12 (2004)
Steinitz, E., Rademacher, H.: Vorlesungen über die Theorie der Polyeder. Springer, Berlin (1934)
Stickney, A., Watson, L.: Digraph models of Bard-type algorithms for the linear complementarity problem. Math. Oper. Res. 3, 322–333 (1978)
Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54, 150–168 (1932)
Ziegler, G.M.: Lectures on Polytopes. Springer, New York (1995)
Acknowledgments
The authors would like to thank the referees for their suggestions, which led to numerous improvements to the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Günter M. Ziegler
Rights and permissions
About this article
Cite this article
Locke, R.E., Morris, W.D. A Mihalisin–Klee Theorem for Fans. Discrete Comput Geom 56, 114–125 (2016). https://doi.org/10.1007/s00454-016-9787-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-016-9787-1