Simplicial Complexes of Graphs (Record no. 11125)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03779nam a22005055i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-540-75859-4 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20190213151551.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 100301s2008 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783540758594 |
| -- | 978-3-540-75859-4 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-540-75859-4 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA150-272 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | PBD |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | MAT008000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | PBD |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.1 |
| Edition number | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Jonsson, Jakob. |
| Relator term | author. |
| Relator code | aut |
| -- | http://id.loc.gov/vocabulary/relators/aut |
| 245 10 - TITLE STATEMENT | |
| Title | Simplicial Complexes of Graphs |
| Medium | [electronic resource] / |
| Statement of responsibility, etc | by Jakob Jonsson. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 2008. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XIV, 382 p. 34 illus. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Mathematics, |
| International Standard Serial Number | 0075-8434 ; |
| Volume number/sequential designation | 1928 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Combinatorics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algebraic topology. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algebra. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete Mathematics. |
| -- | http://scigraph.springernature.com/things/product-market-codes/M29000 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Combinatorics. |
| -- | http://scigraph.springernature.com/things/product-market-codes/M29010 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algebraic Topology. |
| -- | http://scigraph.springernature.com/things/product-market-codes/M28019 |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Order, Lattices, Ordered Algebraic Structures. |
| -- | http://scigraph.springernature.com/things/product-market-codes/M11124 |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783540845249 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783540758587 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Mathematics, |
| -- | 0075-8434 ; |
| Volume number/sequential designation | 1928 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://doi.org/10.1007/978-3-540-75859-4 |
| 912 ## - | |
| -- | ZDB-2-SMA |
| 912 ## - | |
| -- | ZDB-2-LNM |
No items available.