Recall that the associahedron A n is the complex of graphs on the vertex set [n] without crossings and boundary edges. The associahedron was introduced by Stasheff [136]. We discuss the associahedron and some related dihedral properties, all defined in terms of crossing avoidance.
Keywords
- Euler Characteristic
- Fine Number
- Homotopy Type
- Boundary Edge
- Cone Point
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Noncrossing Graphs. In: Simplicial Complexes of Graphs. Lecture Notes in Mathematics, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75859-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-75859-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75858-7
Online ISBN: 978-3-540-75859-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
