Complexes of directed trees and independence complexes

DOI10.1016/j.disc.2008.09.033zbMath1226.05084arXivmath/0508148OpenAlexW2001387919MaRDI QIDQ1025954

Alexander Engström

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0508148

zbMATH Keywords

shellabilitytopological combinatoricsindependence complexesanti-rips complexescomplexes of directed trees

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items

A note on independence complexes of chordal graphs and dismantling ⋮ Divisors on graphs, binomial and monomial ideals, and cellular resolutions ⋮ On the homology of independence complexes ⋮ The cubical matching complex revisited ⋮ A simplicial complex is uniquely determined by its set of discrete Morse functions ⋮ Matching and independence complexes related to small grids ⋮ Star clusters in independence complexes of graphs ⋮ General polygonal line tilings and their matching complexes ⋮ Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs ⋮ Perfect matching complexes of honeycomb graphs ⋮ Splittings of independence complexes and the powers of cycles ⋮ Dominance complexes and vertex cover numbers of graphs ⋮ On the homology of the real complement of the \(k\)-parabolic subspace arrangement ⋮ The cyclomatic number of a graph and its independence polynomial at \(- 1\) ⋮ Weighted sheaves and homology of Artin groups ⋮ Complexity of simplicial homology and independence complexes of chordal graphs ⋮ Cores of simplicial complexes ⋮ Matching complexes of small grids ⋮ Certain homology cycles of the independence complex of grids ⋮ Boolean formulae, hypergraphs and combinatorial topology ⋮ Independence complexes of chordal graphs ⋮ Homotopy type of circle graph complexes motivated by extreme Khovanov homology ⋮ Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs ⋮ A functorial Dowker theorem and persistent homology of asymmetric networks ⋮ The facet ideals of matching complexes of line graphs ⋮ Matching complexes of trees and applications of the matching tree algorithm ⋮ Matching complexes of polygonal line tilings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems for transversals in graphs with bounded degree
• The roots of the independence polynomial of a clawfree graph
• On the independence complex of square grids
• Homotopy properties of greedoids
• Morse theory for cell complexes
• Domination numbers and homology
• A general homotopy complementation formula.
• Complexes of directed trees
• Proof of the Lovász conjecture
• Independence complexes of claw-free graphs
• The topology of the independence complex
• Hard squares with negative activity and rhombus tilings of the plane
• WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
• A simple proof for folds on both sides in complexes of graph homomorphisms
• A short proof of a conjecture on the connectivity of graph coloring complexes
• Chessboard Complexes and Matching Complexes
• Shellable Nonpure Complexes and Posets. I