3 citations · 3 across the 1 of their papers we have counts for
1 paper
Zoltan Furedi, Younjin Kim
A graph G is called H-saturated if it does not contain any copy of H, but for any edge e in the complement of G the graph G+e contains some H. The minimum size of an…