graphs was studied by Simonovits and Sós for both induced [@SS1] and not-necessarily induced subgraphs [@SS2] as well as for hypergraphs by Conlon, Hàn, Person and Schacht [@CHPS] and Dellamonica and Rödl [@DR]. In case of graphs the not-necessarily induced case turned out to be much easier and was resolved by Simonovits and Sós [@SS2] who showed that all non-empty graphs must be ‘locally forcing’. This was recently reproved, without use of the regularity lemma, by Conlon, Fox and Sudakov [@CFS]. On the other hand the induced case is still very much open and seems to be the closer analogue to our problem. Indeed, in the case of embedding a tournament one needs to ensure that each pair of vertices get mapped to an edge with one of two possible orientations, while in the induced case each pair needs to be sent to one of two possible states (is an edge or is not an edge). One of the main conjectures in the area, due to Simonovits and Sós [@SS2] says that all graphs on $4$ or more vertices must be ‘locally forcing’ in the appropriate induced sense. They prove their conjecture holds for regular graphs and for various other 