On F-independence in graphs

• DOI: 10.7151/dmgt.1453
• Publication Date: 2012-02-29T09:02:10Z
• Authors: Frank Göring; Jochen. Harant; Dieter Rautenbach; Ingo Schiermeyer
• Keywords: Independence; Independence number

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