Yusuf Civan

activity

20032026

most citedBounding Castelnuovo-Mumford regularity of graphs via Lozin's transformation

9 citations · 25 across the 11 of their papers we have counts for

collaborators

13 papers

math.CO2026

Projective dimension of closed neighborhood hypergraphs via extended double covers

Yusuf Civan, Anurag Singh

Let $G$ be a finite and simple graph without isolated vertices. We investigate the projective dimension of the closed neighborhood hypergraph $N [G]$ and its relationship…

math.CO2024

Chordal bipartite graphs, biclique vertex partitions and Castelnuovo-Mumford regularity of $1$ -subdivision graphs

Yusuf Civan, Zakir Deniz, Oleg Duginov +1

A biclique in a graph $G$ is a complete bipartite subgraph (not necessarily induced), and the least positive integer $k$ for which the vertex set of $G$ can be partitioned into at…

math.CO2022

The $v$ -number and Castelnuovo-Mumford regularity of graphs

Yusuf Civan

We prove that for every integer $k \geq 1$ , there exists a connected graph $H_{k}$ such that $v (H_{k}) = r e g (H_{k}) + k$ , where $v (G)$ and $r e g (G)$ denote the $v$ -number and the (Castelnuovo-…

math.CO2022

Bounding the collapsibility number of simplicial complexes and graphs

Türker Bıyıkoğlu, Yusuf Civan

We introduce and study a new combinatorial invariant the theta-number $θ (X)$ of simplicial complexes, and prove that the inequality $C (X) \leq θ (X)$ holds for every simpli…

math.CO2020

Order-sensitive domination in partially ordered sets

Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim

For a (finite) partially ordered set (poset) $P$ , we call a dominating set $D$ in the comparability graph of $P$ , an order-sensitive dominating set in $P$ if either $x \in D$ or els…

math.CO2016★ 3 cited

Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs