---

＜電子ブック＞
Simplicial Complexes of Graphs / by Jakob Jonsson
(Lecture Notes in Mathematics. ISSN:16179692 ; 1928)

版	1st ed. 2008.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2008
本文言語	英語
大きさ	XIV, 382 p. 34 illus : online resource
著者標目	*Jonsson, Jakob author SpringerLink (Online service)
件　名	LCSH:Discrete mathematics LCSH:Algebraic topology LCSH:Algebra FREE:Discrete Mathematics FREE:Algebraic Topology FREE:Order, Lattices, Ordered Algebraic Structures
一般注記	and Basic Concepts -- and Overview -- Abstract Graphs and Set Systems -- Simplicial Topology -- Tools -- Discrete Morse Theory -- Decision Trees -- Miscellaneous Results -- Overview of Graph Complexes -- Graph Properties -- Dihedral Graph Properties -- Digraph Properties -- Main Goals and Proof Techniques -- Vertex Degree -- Matchings -- Graphs of Bounded Degree -- Cycles and Crossings -- Forests and Matroids -- Bipartite Graphs -- Directed Variants of Forests and Bipartite Graphs -- Noncrossing Graphs -- Non-Hamiltonian Graphs -- Connectivity -- Disconnected Graphs -- Not 2-connected Graphs -- Not 3-connected Graphs and Beyond -- Dihedral Variants of k-connected Graphs -- Directed Variants of Connected Graphs -- Not 2-edge-connected Graphs -- Cliques and Stable Sets -- Graphs Avoiding k-matchings -- t-colorable Graphs -- Graphs and Hypergraphs with Bounded Covering Number -- Open Problems -- Open Problems 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 HTTP:URL=https://doi.org/10.1007/978-3-540-75859-4

 類似資料