M. Yıldız

most citedDefective Ramsey Numbers in Graph Classes

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

collaborators

3 papers

math.CO2021

Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs

Yunus Emre Demirci, Tınaz Ekim, Mehmet Akif Yıldız

In this paper, we investigate a variant of Ramsey numbers called defective Ramsey numbers where cliques and independent sets are generalized to $k$ -dense and $k$ -sparse sets, both…

math.CO2019★ 2 cited

Defective Ramsey Numbers in Graph Classes

Yunus Emre Demirci, Tınaz Ekim, John Gimbel +1

Given a graph $G$ , a $k$ -sparse $j$ -set is a set of $j$ vertices inducing a subgraph with maximum degree at most $k$ . A $k$ -dense $i$ -set is a set of $i$ vertices that is $k$ -spars…

math.CO2019

Linear Time Recognition of Equimatchable Split Graphs

Mehmet Akif Yıldız

A maximal matching $M$ that consists of independent edges is a subgraph of a simple and undirected graph $G$ for which $G - M$ forms an independent set. A graph $G$ is called equimat…