We introduce an idea called anti-gadgets in complexity reductions. These
combinatorial gadgets have the effect of erasing the presence of some other
graph fragment, as if we had managed to include a negative copy of a graph
gadget.