Instance: An undirected graph $G$ and a positive integer $k$ Question: Does $G$ contain a vertex cover of size $\leq k$ or a clique of size $\geq k$? Obviously, this problem is solved by polynomial reduction, but is it from Clique or Vertex Cover? And how? I've tried to reduce from both problems,...