I am supposed to convert this problem to a Satisfiability Problem in Conjunctive Normal Form, but I have no idea how.
The Problem: Determine, if there exists any dominant set for a Graph $G$ containing at most $n/4$ vertices. ($n = $ total number of vertices in $G$
Could you please help me or at least give me a hint or explain how to do it, because I have really no idea :(