1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2024
Bounds on the connectivity of the independence complexes of hypergraphs
Demet Taylan
We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of -uniform p…
math.CO2018★ 1 cited
Topology of random d-clique complexes
Demet Taylan
For a simplicial complex , the -clique complex is the simplicial complex having all subsets of vertices whose -subsets are contained by as its faces. We…
math.CO2015
Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs
Demet Taylan
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graph…