ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, and let tmc(G)tmc(G), respectively mc(G)mc(G), denote its total monochromatic connection number, respectively monochromatic connection number.

Total monochromatic connection conjecture. For a connected graph GG, it always holds that

tmc(G)>mc(G).tmc(G)>mc(G).

This conjecture compares total monochromatic connection with monochromatic connection. The source notes that the equality tmc(G)=mc(G)+l(G)tmc(G)=mc(G)+l(G) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.