{
"item_title" : "Simplicial Complexes of Graphs",
"item_author" : [" Jakob Jonsson "],
"item_description" : "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. 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.",
"item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/54/075/858/3540758585_b.jpg",
"price_data" : {
"retail_price" : "69.99", "online_price" : "69.99", "our_price" : "69.99", "club_price" : "69.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Simplicial Complexes of Graphs
Overview
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. 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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783540758587
- ISBN-10: 3540758585
- Publisher: Springer
- Publish Date: November 2007
- Dimensions: 9.1 x 6.1 x 0.9 inches
- Shipping Weight: 1.25 pounds
- Page Count: 382
Related Categories
