ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LL be a finite non-abelian simple group, and let DD be a conjugacy class of involutions in LL. Consider the complete graph Γ\Gamma with vertex set DD. Define an equivalence relation ∼\sim (graph coloring) on the set of edges as follows: (a,b)∼(c,d)(a,b)\sim(c,d) if and only if ∣ab∣=∣cd∣|ab|=|cd|. An automorphism of the coloured graph Γ\Gamma is a permutation τ∈SD\tau\in S_D such that (a,b)∼(aτ,bτ)(a,b)\sim(a^\tau,b^\tau) for every edge (a,b)(a,b). Is it true that the automorphism group of Γ\Gamma is a subgroup of Aut⁡(L)\operatorname{Aut}(L)?

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.