Kourovka Notebook Problem 21.52
Statement
Let be a finite non-abelian simple group, and let be a conjugacy class of involutions in . Consider the complete graph with vertex set . Define an equivalence relation (graph coloring) on the set of edges as follows: if and only if . An automorphism of the coloured graph is a permutation such that for every edge . Is it true that the automorphism group of is a subgroup of ?
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.