Erdős Problem #1098 — Finite Clique Bounds in Non-Commuting Graphs
Statement
For every group , let its non-commuting graph have vertex set , with adjacent to exactly when . If every clique of this graph is finite, does there exist a natural number such that every finite clique has at most vertices?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.