ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph of order nn. A graph is 3t3_t-critical if its total domination number is 33 and adding an edge between any nonadjacent vertices lowers its total domination number. Suppose in addition that GG has diameter 22, and let mm denote its number of edges. Edge-size conjecture for diameter-2, 3t3_t-critical graphs. Then

m≥n(n−2)4.m\geq\frac{n(n-2)}{4}.

A proof of this conjecture would, according to the source, imply the Murty–Simon conjecture together with the cited results for the diameter-3 case; the supplied text does not state that it 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 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.