"Graph Simplizialer Komplex." . . . . . . . . . "Simplicial Complexes of Graphs" . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "Elektronisches Buch" . . . . . . . . "Simplicial complexes of graphs"@en . "Simplicial complexes of graphs" . . . . . . . . . . . . . . . . "Llibres electrònics" . . "Electronic books"@en . "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."@en . "Simplical complexes of graphs" . "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." . . "Algebra homológica." . . "Àlgebra homològica." . . . "Topologie algebrică." . . "Arbres de décision." . . "Complexes." . . "Decision trees." . . "Morse theory." . . "Topological graph theory." . . "Arbres (Teoria de grafs)" . . "Matematică." . . "Gráfelmélet." . . "Mètodes gràfics." . . "Graph theory." . . "Grafos, Teoría de." . . "Théorie de Morse." . . "Combinatorial analysis." . . "Algebra." . . "Algebră." . "Teoría Morse." . . "Algèbre homologique." . . "Algebrai topológia." . . "Graphes, Théorie des." . . "Algebraische Kombinatorik." . . "Algebra, Homological." . . "Algebraic topology." . . "Algebraic Topology." . "Teoria de grafs." . . "Mathematics." . . "Simplizialer Komplex." . . "Simplizialer Komplex" . "Combinatorics." . . "Matemàtica Mètodes gràfics." . . "Arboles de decisión." . . "Graph." . . "Graph" . "Morse, Théorie de." . . "Teoria de Morse." . . "Teoría de grafos." . . "Théorie des graphes." . . "Topologische Graphentheorie." . . "Mathématiques." . . "Order, Lattices, Ordered Algebraic Structures" . . "Order, Lattices, Ordered Algebraic Structures." .