The diameter-three conjecture for small Weyl graphs
Statement
Let be an irreducible classical root system of rank at least , and let be its small Weyl graph. The diameter of a graph is the maximum distance between two of its vertices. Diameter-three conjecture. The diameter of is at most . This is suggested by computations for several root systems, in which the diameter was always at most ; the general case remains open.
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.