Recall the definition of the Independent Set problem: a set of vertices in a graph where no two vertices are adjacent, and the size of the set is at least a given integer k.

Construct a graph where each vertex represents a clause-variable pair, and edges are added between vertices that cannot be in the same independent set due to conflicting assignments.

Prove the reduction by showing that a satisfying assignment for the 3SAT instance corresponds to an independent set of the constructed graph of size at least the number of clauses, and vice versa.