ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n≥1n\geq 1, let D(Sn)D(S_n) and D(An)D(A_n) be the divisibility graphs whose vertices correspond to conjugacy classes of SnS_n and AnA_n, respectively, with adjacency determined by divisibility of conjugacy-class sizes. Diameter conjecture. The best upper bound for the diameter of D(Sn)D(S_n) and D(An)D(A_n) is 44. This conjecture sharpens the preceding bounds diam⁡(D(Sn))≤8\operatorname{diam}(D(S_n))\leq 8 and diam⁡(D(An))≤10\operatorname{diam}(D(A_n))\leq 10; 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 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.