Erdős Problem #1098 — Finite Clique Bounds in Non-Commuting Graphs

For every group $G$, let its non-commuting graph have vertex set $G$, with $g$ adjacent to $h$ exactly when $gh\ne hg$. If every clique of this graph is finite, does there exist a natural number $n$ such that every finite clique has at most $n$ vertices?