◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Demet Taylan

3 papers hereh-index 214 citations6 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • math.CO3

identity via Semantic Scholar / OpenAlex

activity
20152024
most citedTopology of random d-clique complexes

1 citations · 1 across the 3 of their papers we have counts for

collaborators

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 d-uniform p…

math.CO2018★ 1 cited

Topology of random d-clique complexes

Demet Taylan

For a simplicial complex X, the d-clique complex Δd​(X) is the simplicial complex having all subsets of vertices whose (d+1)-subsets are contained by X 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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.