sentences:  That is, every substructure (of a given type) of a graph in the family must be another graph in the family.Equivalently, if a graph is not part of the family, all larger graphs containing it as a substructure must also be excluded from the family.When this is true, there always exists an obstruction set (the set of graphs that are not in the family but whose smaller substructures all belong to the family).