Let F be a set of graphs and for a graph G let F(G) and F (G) denote the maximum order of an induced subgraph of G which does not contain a graph in F as a subgraph and which does not contain a graph in F as an induced subgraph, respectively. Lower bounds on F (G) and F (G) and algorithms realizing them are presented.