Class 1 conjecture for relative non-commuting graphs of proper non-commutative subrings
Statement
Let be a ring and let be a proper non-commutative subring of . The relative non-commuting graph has chromatic index equal to its maximum vertex degree.
Class 1 conjecture. The relative non-commuting graph is of class .
For a graph, being of class means that its chromatic index equals its maximum vertex degree, in contrast with class , where the chromatic index is one larger. The paper establishes that the non-commuting graph of a ring is of class ; the asserted class property for proper relative non-commuting graphs is presented as a conjecture.
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.