Abstract
In this chapter, we discuss optimization problems on orientations of a given graph, where the values of the objective functions are determined by the out-degrees of the resulted directed graph and the constraints contain acyclicity of the orientations. We survey applications of such optimization problems in polytope theory, shellability of simplicial complexes, and acyclic partitions. We also discuss such optimization problems without acyclicity constraint.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Björner, A.: Posets, regular CW complexes and Bruhat order. Eur. J. Combin. 5, 7–16 (1984)
Björner, A.: Topological methods. In: Graham, R., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, pp. 1819–1872. North-Holland (1995)
Björner, A., Wachs, M.: On lexicographically shellable posets. Trans. Am. Math. Soc. 277, 323–341 (1983)
Björner, A., Wachs, M.: Shellable nonpure complexes and posets I. Trans. Am. Math. Soc. 348, 1299–1327 (1996)
Björner, A., Wachs, M.: Shellable nonpure complexes and posets II. Trans. Am. Math. Soc. 349, 3945–3975 (1997)
Blind, R., Mani, P.: On puzzles and polytope isomorphisms. Aequationes Math. 34, 287–297 (1987)
Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)
Danaraj, G., Klee, V.: A presentation of \(2\)-dimensional pseudomanifolds and its use in the design of a linear-time shelling algorithm. Ann. Discrete Math. 2, 53–63 (1978)
Duval, A.M., Goeckner, B., Klivans, C.J., Martin, J.L.: A non-partitionable Cohen-Macaulay simplicial complex. Adv. Math. 299, 381–395 (2016)
Forman, R.: Morse theory for cell complexes. Adv. Math. 134, 90–145 (1998)
Hachimori, M.: Orientations on simplicial complexes and cubical complexes, unpublished manuscript, 8 p. (http://infoshako.sk.tsukuba.ac.jp/~hachi/archives/cubic_morse4.pdf)
Hachimori, M., Kashiwabara, K.: Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness. J. Combin. Theory Ser. A 118(5), 1608–1623 (2011)
Hachimori, M., Moriyama, S.: A note on shellability and acyclic orientations. Discrete Math. 308, 2379–2381 (2008)
Kalai, G.: A simple way to tell a simple polytope from its graph. J. Combin. Theory Ser. A 49(2), 381–383 (1988)
Kleinschmidt, P., Onn, S.: Signable posets and partitionable simplicial complexes. Discrete Comput. Geom. 15, 443–466 (1996)
Kaibel, V., Pfetsch, M.: Some algorithmic problems in polytope theory. In: Joswig, M., Takayama, N. (eds.) Algebra, Geometry and Software Systems, pp. 23–47. Springer, Berlin (2003)
Milnor, J.: Morse Theory. Princeton University Press, Princeton (1963)
Stanley, R.P.: Combinatorics and Commutative Algebra, 2nd edn. Birkhäuser, Boston (1996)
Wachs, M.: Obstructions to shellability. Discrete Comput. Geom. 22, 95–103 (2000)
Williamson Hoke, K.: Completely unimodal numberings of a simple polytope. Discrete Appl. Math. 20, 69–81 (1996)
Ziegler, G.: Lectures on Polytopes. Springer, Berlin (1994). Second revised printing 1998
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Hachimori, M. (2018). Optimization Problems on Acyclic Orientations of Graphs, Shellability of Simplicial Complexes, and Acyclic Partitions. In: Neogy, S., Bapat, R., Dubey, D. (eds) Mathematical Programming and Game Theory. Indian Statistical Institute Series. Springer, Singapore. https://doi.org/10.1007/978-981-13-3059-9_3
Download citation
DOI: https://doi.org/10.1007/978-981-13-3059-9_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-3058-2
Online ISBN: 978-981-13-3059-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)