1 paper · 1 filter
Keren Censor-Hillel, Majd Khoury
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become trian…