Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Simplicial Complexes of Graphs

BuchKartoniert, Paperback
382 Seiten
Englisch
Springererschienen am15.11.2007
A graph complex is a finite family of graphs closed under deletion of edges. 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.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR69,54
E-BookPDF1 - PDF WatermarkE-Book
EUR69,54

Produkt

KlappentextA graph complex is a finite family of graphs closed under deletion of edges. 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.
Details
ISBN/GTIN978-3-540-75858-7
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2007
Erscheinungsdatum15.11.2007
ReiheLecture Notes in Mathematics
Seiten382 Seiten
SpracheEnglisch
Gewicht636 g
IllustrationenXIV, 382 p. 34 illus.
Artikel-Nr.10848612

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr
Kritik
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)mehr