Skip to main content

Noncrossing Graphs

  • Chapter
  • 1900 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1928)

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

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   49.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   64.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints 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