The total monochromatic connection conjecture
Statement
Let be a connected graph, and let , respectively , denote its total monochromatic connection number, respectively monochromatic connection number.
Total monochromatic connection conjecture. For a connected graph , it always holds that
This conjecture compares total monochromatic connection with monochromatic connection. The source notes that the equality holds for almost all graphs, while complete graphs and wheels provide different comparisons; whether the strict inequality holds for every connected graph 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.