Jiang, Li and Zhang's total monochromatic connection conjecture
Statement
Let be a connected graph. Jiang, Li and Zhang's conjecture. It always holds that
The conjecture compares the total monochromatic connection number with the monochromatic connection number for connected graphs; its status is not resolved in the supplied source.
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.