Simplicial complexes of graphs
The subject of this book is the topology of graph complexes. A graph complex is a family of graphs (on a fixed vertex set) which is closed under deletion of edges. Since the vertex set is fixed, each graph in the family \(\Delta\) may be identified with its edge set and \(\Delta\) may be interpreted as a simplicial complex and realized as a geometric object whose topology can be analyzed. A family of graphs, \(\Delta\), is called a graph property if \(\Delta\) is invariant under the action of the symmetric group on the underlying vertex set. Topological and enumerative properties of monotone graph properties such as matchings, forests, bipartite graphs, non-Hamiltonian graphs, not-k-connected graphs are discussed. The twenty-seven chapters of the book are organized into eight parts. Part I provides an overview over the entire volume and introduces the basic concepts such as abstract graphs and set systems, matroids and simplicial topology. Part II introduces the major tools, disctrete Morse theory [\textit{R. Forman}, A discrete Morse theory for cell complexes. Geometry, topology and physics for Raoul Bott. Lectures of a conference in honor of Raoul Bott's 70th birthday, Harvard University, Cambridge, MA, USA 1993. Cambridge, MA: International Press. Conf. Proc. Lect. Notes Geom. Topol. 4, 112--125 (1995; Zbl 0867.57018)]; and decision trees [Combinatorica 20, No.4, 489--504 (2000 Zbl 1028.05110)]. The third part gives an overview of graph complexes by providing lists and illustrations of particular graph properties and spelling out the main goals and proof techniques. Parts IV to VII, titled Vertex Degree, Cycles and Crossings, Connectivity, Cliques and Stable Sets, contain the results promised in the overview, several of them are new, some previously published. Part VIII contains a list of well formulated open problems, organized by the chapter to which they are related or where they were previously stated. In some cases conjectures are provided. Readers who mastered parts I-VII will tackle these problems to test their mastery. Researchers, who find any of the stated problems intriguing, will be enticed to read the book.
- Graphs associated with simplicial complexes
- scientific article; zbMATH DE number 4093496
- Simplicial Powers of Graphs
- Simplicial powers of graphs
- scientific article; zbMATH DE number 3875336
- Simplices and spectra of graphs
- Complexes of connected graphs
- Graphs and balanced simplicial complexes
- The simplex geometry of graphs
- scientific article; zbMATH DE number 1409212
- Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory
- Cycle-free chessboard complexes and symmetric homology of algebras
- A uniform approach to complexes arising from forests
- Five-torsion in the homology of the matching complex on 14 vertices
- Simplicial schemes
- Complexes of not i-connected graphs
- Collapsibility of read/write models using discrete Morse theory
- Hierarchical sequencing of online social graphs
- Homotopy type of neighborhood complexes of Kneser graphs, \(KG_{2,k}\)
- Shellable posets arising from the even subgraphs of a graph
- Weighted sheaves and homology of Artin groups
- Optimal graphs for independence and \(k\)-independence polynomials
- Directed subgraph complexes
- Optimal decision trees on simplicial complexes
- Shedding vertices of vertex decomposable well-covered graphs
- The cyclomatic number of a graph and its independence polynomial at - 1
- Matching complexes of small grids
- Neighborhood complexes of Cayley graphs with generating set of size two
- Symmetric multiple chessboard complexes and a new theorem of Tverberg type
- Completions, perforations and fillings
- Hilbert function and facet ideals of products of simplicial complexes
- Topological stability of the hippocampal spatial map and synaptic transience
- Higher matching complexes of complete graphs and complete bipartite graphs
- Matching complexes of trees and applications of the matching tree algorithm
- Matching complexes of polygonal line tilings
- Leray numbers of complexes of graphs with bounded matching number
- Morse resolutions of powers of square-free monomial ideals of projective dimension one
- Connectivity at infinity for state spaces of complete bipartite graphs
- The energy of a simplicial complex
- Complexes of marked graphs in gauge theory
- Tri-partitions and bases of an ordered complex
- A positivity phenomenon in Elser's Gaussian-cluster percolation model
- Homotopy type of skeleta of the flag complex over a finite vector space and generalized Galois numbers
- Occupants in simplicial complexes
- Homomorphism complexes and maximal chains in graded posets
- Collapsibility of simplicial complexes of hypergraphs
- On configuration spaces and simplicial complexes
- Simplicial complexes of Whisker type
- Optimal bounds for the colored Tverberg problem
- Matching and independence complexes related to small grids
- Erdős-Ko-Rado theorems for simplicial complexes
- Discrete Morse theory and the homotopy type of clique graphs
- Tverberg's theorem and graph coloring
- Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs
- Betti splitting via componentwise linear ideals
- Completing and extending shellings of vertex decomposable complexes
- A characterization of two-dimensional Buchsbaum matching complexes
- On Elser's conjecture and the topology of \(U\)-nucleus complex
- Recursive Betti numbers for Cohen-Macaulay \(d\)-partite clutters arising from posets
- Neighborhood complexes of some exponential graphs
- The Morse theory of Čech and Delaunay complexes
- Completions and Simplicial Complexes
- Persistent homology of complex networks
- On the homotopy type of complexes of graphs with bounded domination number
- Combinatorics on Adjacency Graphs and Incidence Pseudographs
- Simplicial complexes of triangular Ferrers boards
- Polyhedral representation of discrete Morse functions
- Hom complexes and hypergraph colorings
- Chains of modular elements and shellability
- Complexes of connected graphs
- scientific article; zbMATH DE number 1500688 (Why is no real title available?)
- scientific article; zbMATH DE number 1504590 (Why is no real title available?)
- scientific article; zbMATH DE number 1522572 (Why is no real title available?)
- Unit ball graph homology
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- scientific article; zbMATH DE number 2103306 (Why is no real title available?)
- scientific article; zbMATH DE number 6157492 (Why is no real title available?)
- The simplex geometry of graphs
- Generalized chessboard complexes and discrete Morse theory
- Higher independence complexes of graphs and their homotopy types
- Counting induced subgraphs: a topological approach to \#W[1]-hardness
- Simplicial complexes and the evasiveness conjecture
- Topology of clique complexes of line graphs
- On the homology of independence complexes
- Simplicial complexes with lattice structures
- The cubical matching complex revisited
- Multiple chessboard complexes and the colored Tverberg problem
- Filtered matchings and simplicial complexes
- Chimera state and route to explosive synchronization
- Colorful subhypergraphs in uniform hypergraphs
- Hajós-type constructions and neighborhood complexes
- Topological connectedness and independent sets in graphs
- SPANNING SIMPLICIAL COMPLEXES OF n-CYCLIC GRAPHS WITH A COMMON VERTEX
- Characterizing the complexity of time series networks of dynamical systems: a simplicial approach
- Simplicial complexes and complex systems
- Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness
- Deformation retracts of neighborhood complexes of stable Kneser graphs
- A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
- Chessboard complexes indomitable
- Completing and extending shellings of vertex decomposable complexes
- The canonical join complex of the Tamari lattice
- Discrete Morse theory for complexes of 2-connected graphs
- General polygonal line tilings and their matching complexes
- Discrete differential calculus on simplicial complexes and constrained homology
- Filtered simplicial homology, graph dissimilarity and überhomology
- Perfect matching complexes of honeycomb graphs
- A new measure for the attitude to mobility of Italian students and graduates: a topological data analysis approach
- Star clusters in the matching, Morse, and generalized complex of discrete Morse functions
- MANIFOLD MATCHING COMPLEXES
- The graph minor theorem in topological combinatorics
This page was built for publication: Simplicial complexes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2459925)
