3 options
Simplicial Complexes of Graphs / by Jakob Jonsson.
Math/Physics/Astronomy Library QA3 .L28 v.1-999 470,523,830,849:2nd ed. v.1000-1722,1762,1781,1799-2099,2100-2192-2218 2219-2223-2258,2260-2271,2273-2274-2277,2279-2281,2283-2289,2291,2293-2294,2296,2298-2299,2300-2311,2313-2366,2368-2379,2381-2382 2385,2388-2389
Mixed Availability
LIBRA QA3 .L28 Scattered vols.
Mixed Availability
- Format:
- Book
- Author/Creator:
- Jakob Jónsson, author.
- Series:
- Lecture Notes in Mathematics, 0075-8434 ; 1928.
- Lecture Notes in Mathematics, 0075-8434 ; 1928
- Language:
- English
- Subjects (All):
- Combinatorial analysis.
- Algebraic topology.
- Algebra.
- Discrete Mathematics.
- Combinatorics.
- Algebraic Topology.
- Order, Lattices, Ordered Algebraic Structures.
- Local Subjects:
- Discrete Mathematics.
- Combinatorics.
- Algebraic Topology.
- Order, Lattices, Ordered Algebraic Structures.
- Physical Description:
- 1 online resource (XIV, 382 pages 34 illustrations).
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
- System Details:
- text file PDF
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 9783540758594
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.