Bounded-diameter conjecture for commuting graphs of centerless finite groups
Statement
Let be a finite group with trivial centre, and let its commuting graph be the graph whose vertices are the non-central elements of , with two distinct vertices adjacent exactly when they commute in . Centerless commuting-graph conjecture. There is an absolute constant such that the commuting graph of is either disconnected or has diameter at most . This is proposed after the unrestricted conjecture is disproved by finite special -groups with commuting graphs of arbitrarily large diameter; the status of the centerless case is left open in the paper.
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.