The diameter conjecture for divisibility graphs of symmetric and alternating groups
Statement
For , let and be the divisibility graphs whose vertices correspond to conjugacy classes of and , respectively, with adjacency determined by divisibility of conjugacy-class sizes. Diameter conjecture. The best upper bound for the diameter of and is . This conjecture sharpens the preceding bounds and ; the source provides no resolution.
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.