Complexes of not i-connected graphs
From MaRDI portal
Abstract: Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not -connected -hypergraphs on vertices. We show that the complex of not -connected graphs has the homotopy type of a wedge of spheres of dimension . This answers one of the questions raised by Vassiliev in connection with knot invariants. For this case the -action on the homology of the complex is also determined. For complexes of not -connected -hypergraphs we provide a formula for the generating function of the Euler characteristic, and we introduce certain lattices of graphs that encode their topology. We also present partial results for some other cases. In particular, we show that the complex of not -connected graphs is Alexander dual to the complex of partial matchings of the complete graph. For not -connected graphs we provide a formula for the generating function of the Euler characteristic.
Recommendations
- Complexes of connected graphs
- Complexes of graphs with bounded independence number
- Complexes of graphs with bounded independence number
- Complexes of graph homomorphisms
- Links in the complex of separable graphs
- On the connectivity of infinite graphs and 2-complexes
- Simplicial complexes of graphs
- Complexes oft-Colorable Graphs
- Homologies of complexes of doubly connected graphs
- On connectivity of the facet graphs of simplicial complexes
Cited in
(36)- Homotopy type of skeleta of the flag complex over a finite vector space and generalized Galois numbers
- The integral tree representation of the symmetric group
- Complexes of graph homomorphisms
- Complexes of connected graphs
- Torsion in the matching complex and chessboard complex
- Equivariant discrete Morse theory
- Five-torsion in the homology of the matching complex on 14 vertices
- Minimal resolutions and the homology of matching and chessboard complexes
- Complexes of discrete Morse functions
- Connected Plane Sets which Contain no Nondegenerate Connected Simple Graph
- n-connectedness in pure 2-complexes
- Cycle-free chessboard complexes and symmetric homology of algebras
- Topology of bounded-degree graph complexes.
- Discrete Morse functions from lexicographic orders
- scientific article; zbMATH DE number 1522572 (Why is no real title available?)
- Some results related to the evasiveness conjecture.
- Complexes of directed trees
- Matching complexes, bounded degree graph complexes, and weight spaces of \(\mathrm{GL}_n\)-complexes
- Cohomology of spaces of complex knots
- On the topology of simplicial complexes related to 3-connected and Hamiltonian graphs
- Discrete Morse theory and classifying spaces
- On the topology of two partition posets with forbidden block sizes
- The pre-WDVV ring of physics and its topology
- Exact sequences for the homology of the matching complex
- Homotopy of non-modular partitions and the Whitehouse module
- Combinatorial and topological aspects of path posets, and multipath cohomology
- The \(\mathcal{NF}\)-number of two complete graphs joined by a common vertex
- On efficient sparse integer matrix Smith normal form computations
- Rational homology of spaces of complex monic polynomials with multiple roots
- On the 3-torsion part of the homology of the chessboard complex
- Links in the complex of separable graphs
- Discrete morse theory and the cohomology ring
- On the homotopy type of complexes of graphs with bounded domination number
- Morse theory from an algebraic viewpoint
- On optimizing discrete Morse functions
- Complexes of graphs with bounded matching size
This page was built for publication: Complexes of not \(i\)-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292680)