ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CmC_m and CnC_n be cycle graphs, and let Cm□CnC_m\square C_n be their Cartesian product. Write γe∗(G)\gamma^*_e(G) for the minimum cardinality of an exponential dominating set in a graph GG. The torus exponential domination conjecture. For all mm and nn,

⌈mn13⌉≤γe∗(Cm□Cn).\left\lceil\frac{mn}{13}\right\rceil \le \gamma^*_e(C_m\square C_n).

Together with the known asymptotic construction giving density at most 1/131/13, 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 15.87515.875 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 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.