This fact is interesting because the problem of finding an (n − ε)-clique in a M-graph of size n2 is NP-complete for arbitrarily small positive ε.
Ova činjenica je interesantna jer je problem pronalaženja (n − ε)-klike u M-grafu veličine n2 NP-kompletan za proizvoljno malo ε.