Clique-bounded degree conjecture for derangement graphs
Statement
Let ) be a transitive permutation group of degree , and let denote its derangement graph. For a positive integer , say that contains no clique of size when it has no complete subgraph on vertices. Clique-bounded degree conjecture. There exists a function such that, if is a transitive permutation group of degree whose derangement graph contains no clique of size , then
The conjecture formalizes the observation that excluding large cliques in derangement graphs should strongly restrict the degree of a transitive action; the supplied text gives no resolution status.
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.