Simplicial Complexes of Graphs

AvJakob Jonsson

Häftad, Engelska, 2007

Del 1928 i serien Lecture Notes in Mathematics

712 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

E-bok

868 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2007-11-15
Mått:155 x 235 x 22 mm
Vikt:604 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Mathematics
Antal sidor:382
Upplaga:2008
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540758587

Utforska kategorier

Kombinatorik och grafteori inom Naturvetenskap och teknik

Recensioner i media

From the reviews: "The subject of this book is the topology of graph complexes. A graph complex is a family of graphs ... which is closed under deletion of edges. ... Topological and enumerative properties of monotone graph properties such as matchings, forests, bipartite graphs, non-Hamiltonian graphs, not-k-connected graphs are discussed. ... Researchers, who find any of the stated problems intriguing, will be enticed to read the book." (Herman J. Servatius, Zentralblatt MATH, Vol. 1152, 2009)

Innehållsförteckning

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.

Mer från samma författare

Carolina Widinghoff, Helena Hansson, Anders Håkansson, Anne H Berman, Emma Claesdotter-Knutsson, Jakob Jonsson, Olof Molander, Viktor Månsson, Anders Nilsson, Kristina Wennerstrand - Spelberoende, Häftad

-10% student

Spelberoende

Carolina Widinghoff, Helena Hansson, Anders Håkansson, Anne H Berman, Emma Claesdotter-Knutsson, Jakob Jonsson, Olof Molander, Viktor Månsson, Anders Nilsson, Kristina Wennerstrand

Häftad, 2025

443 kr