2 papers
cs.DM2025
Perfect Graph Modification Problems: An Integer Programming Approach
Burak Nur Erdem, Tınaz Ekim, Zeki Caner TaÅkın
Graph modification problems aim to find a small set of modifications to a graph so that it satisfies a desired property. The literature is rather rich in NP-completeness results an…
math.CO2025
Sparse Sets in Triangle-free Graphs
Tınaz Ekim, Burak Nur Erdem, John Gimbel
A set of vertices is -sparse if it induces a graph with a maximum degree of at most . In this missive, we consider the order of the largest -sparse set in a triangle-free…