M. Yıldız

activity

20192026

most citedDefective Ramsey Numbers in Graph Classes

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

collaborators

Showing 2019Show all

3 papers · 1 filter

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…

math.CO2019★ 1 cited

A study on random permutation graphs

Oğuz Gürerk, Ümit Işlak, Mehmet Akif Yıldız

For a given permutation $π_{n}$ in $S_{n}$ , a random permutation graph is formed by including an edge between two vertices $i$ and $j$ if and only if $(i - j) (π_{n} (i) - π_{n} (j)) < 0$ .…