Coverart for item
The Resource Simplicial complexes of graphs, Jakob Jonsson

Simplicial complexes of graphs, Jakob Jonsson

Label
Simplicial complexes of graphs
Title
Simplicial complexes of graphs
Statement of responsibility
Jakob Jonsson
Creator
Subject
Language
eng
Summary
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
Member of
Cataloging source
GW5XE
http://library.link/vocab/creatorDate
1972-
http://library.link/vocab/creatorName
Jonsson, Jakob
Dewey number
511/.5
Illustrations
illustrations
Index
index present
Language note
English
LC call number
QA166.195
LC item number
.J66 2008eb
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
Series statement
Lecture notes in mathematics,
Series volume
1928
http://library.link/vocab/subjectName
  • Topological graph theory
  • Graph theory
  • Morse theory
  • Decision trees
  • Algebra, Homological
  • Algebra, Homological
  • Decision trees
  • Graph theory
  • Morse theory
  • Topological graph theory
Label
Simplicial complexes of graphs, Jakob Jonsson
Instantiates
Publication
Bibliography note
Includes bibliographical references (pages 363-369) and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Introduction and overview -- Abstract and set systems -- Simplicial topology -- Discrete Morse theory -- Decision trees -- Miscellaneous results -- Graph properties -- Dihedral graph properties -- Diagraph properties -- Main goals and proof techniques -- Matchings -- Graphs of bounded degree -- Forests and matroids -- Bipartite graphs -- Directed variants of forests and bipartite graphs -- Noncrossing graphs -- Non- Hamiltonian graphs -- 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 -- Graphs avoiding k-matching -- t-colorable graphs -- Graphs and hypergraphs with bounded covering number
Control code
233973602
Dimensions
unknown
Extent
1 online resource (xiv, 378 pages)
Form of item
online
Isbn
9783540758594
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-540-75859-4
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-75858-7
Specific material designation
remote
System control number
(OCoLC)233973602
Label
Simplicial complexes of graphs, Jakob Jonsson
Publication
Bibliography note
Includes bibliographical references (pages 363-369) and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Introduction and overview -- Abstract and set systems -- Simplicial topology -- Discrete Morse theory -- Decision trees -- Miscellaneous results -- Graph properties -- Dihedral graph properties -- Diagraph properties -- Main goals and proof techniques -- Matchings -- Graphs of bounded degree -- Forests and matroids -- Bipartite graphs -- Directed variants of forests and bipartite graphs -- Noncrossing graphs -- Non- Hamiltonian graphs -- 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 -- Graphs avoiding k-matching -- t-colorable graphs -- Graphs and hypergraphs with bounded covering number
Control code
233973602
Dimensions
unknown
Extent
1 online resource (xiv, 378 pages)
Form of item
online
Isbn
9783540758594
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-540-75859-4
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-75858-7
Specific material designation
remote
System control number
(OCoLC)233973602

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...