Basically, every graph has a clique, right ? (a node with no arches is a 1clique, and two nodes with an arch in a 2clique)

So, in the aforementioned reduction, If "FEE" is not satisfied, it still has at least one arch (usually), and therefore there is at least a 2clique in the graph created, and hence all mathematics is proven bad. Am I right ?