1 paper
Tınaz Ekim, Burak Nur Erdem, John Gimbel
A set of vertices is k-sparse if it induces a graph with a maximum degree of at most k. In this missive, we consider the order of the largest k-sparse set in a triangle-free…