ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XnX_n be the direct product of complete graphs associated with the positive integer nn, let [?g(n)[? g(n) denote the Jacobsthal function, and let [?γt(Xn)[? \gamma_t(X_n) denote the total domination number of XnX_n. Unbounded total-domination gap conjecture. For all positive integers jj, there exist nn with arbitrarily many prime factors such that

γt(Xn)≤g(n)−j.\gamma_t(X_n) \le g(n)-j.

This conjecture strengthens the question of whether the gap g(n)−γt(Xn)g(n)-\gamma_t(X_n) can be arbitrarily large. The paper proves the assertion for j=16j=16, and its truth for every positive integer jj 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.