Simplicial Complexes of Graphs
Jonsson, Jakob
Sold by GreatBookPrices, Columbia, MD, U.S.A.
AbeBooks Seller since April 6, 2009
Used - Soft cover
Condition: Used - As new
Ships within U.S.A.
Quantity: Over 20 available
Add to basketSold by GreatBookPrices, Columbia, MD, U.S.A.
AbeBooks Seller since April 6, 2009
Condition: Used - As new
Quantity: Over 20 available
Add to basketUnread book in perfect condition.
Seller Inventory # 5436968
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology.
Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology.
Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.
"About this title" may belong to another edition of this title.
Company Name: GreatBookPrices
Legal Entity: Expert Trading, LLC
Address: 9220 Rumsey Road, Ste 101, Columbia MD 21046
Email address: CustomerService@SuperBookDeals.com
Phone number: 410-964-0026
consumer complaints can be addressed to address above
Registration #: 52-1713923
Authorized representative: Danielle Hainsey
Internal processing of your order will take about 1-2 business days. Please allow an additional 4-14 business days for Media Mail delivery. We have multiple ship-from locations - MD,IL,NJ,UK,IN,NV,TN & GA
| Order quantity | 8 to 14 business days | 5 to 14 business days |
|---|---|---|
| First item | US$ 2.64 | US$ 2.64 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.