Behruz Tayfeh-Rezaie

Fix a positive integer n and a graph F . A graph G with n vertices is called F -saturated if G contains no subgraph isomorphic to F but each graph obtained from G by joining a pair of nonadjacent vertices contains at least one copy of F as a subgraph...