loading

Simplicial complexes of graphs / Jonsson, Jakob

Tác giả : Jonsson, Jakob

Nhà xuất bản : Springer

Năm xuất bản : 2008

Mô tả vật lý : 376 p.

Số phân loại : 511.5

Chủ đề : 1. Morse theory. 2. Topological graph theory. 3. Book.

Thông tin chi tiết

Tóm tắt :

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.

 Thông tin dữ liệu nguồn

 Thư viện  Ký hiệu xếp giá  Dữ liệu nguồn
Đại học quốc gia Hà Nội
https://repository.vnu.edu.vn/handle/VNU_123/29870