The unbounded total-domination gap conjecture for direct products of complete graphs
Statement
Let be the direct product of complete graphs associated with the positive integer , let denote the Jacobsthal function, and let denote the total domination number of . Unbounded total-domination gap conjecture. For all positive integers , there exist with arbitrarily many prime factors such that
This conjecture strengthens the question of whether the gap can be arbitrarily large. The paper proves the assertion for , and its truth for every positive integer 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.