The torus exponential domination lower-bound conjecture
Statement
Let and be cycle graphs, and let be their Cartesian product. Write for the minimum cardinality of an exponential dominating set in a graph . The torus exponential domination conjecture. For all and ,
Together with the known asymptotic construction giving density at most , this would determine the optimal density for exponential domination of torus graphs. The stated lower bound is motivated by the existing counting lower bound with denominator and remains unresolved in the supplied source.
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.