Open AccessOn F-independence in graphs
Author(s) -
Frank Göring,
Jochen Harant,
Dieter Rautenbach,
Ingo Schiermeyer
Publication year - 2009
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1453
Subject(s) - mathematics , combinatorics , independence (probability theory) , independence number , discrete mathematics , graph , statistics
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) are presented.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom