Nongsiang–Saikia order conjecture for non-nilpotent graphs
Statement
Let and be finite non-nilpotent groups. For a group , let denote the graph obtained from the graph on in which and are adjacent exactly when is not nilpotent by removing isolated vertices. Nongsiang–Saikia conjecture. If
then
This is a weaker version of the false conjecture that isomorphic non-nilpotent graphs determine the groups themselves up to isomorphism. The supplied text does not state whether the Nongsiang–Saikia conjecture has been resolved.
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.