Lower-bound conjecture for deterministic locating-dominating sets on the infinite king grid

Let KK denote the infinite king grid, and let DET:LD(K)\operatorname{DET:LD}(K) denote its deterministic locating-dominating density. Deterministic locating-dominating density conjecture.

1544DET:LD(K).\frac{15}{44} \leq \operatorname{DET:LD}(K).

The authors believe this can be proved using techniques similar to those already developed, together with a discharging strategy. The conjecture concerns improving the known lower bound for deterministic locating-dominating sets on the infinite king grid.

Sources & referencesView supporting material

Primary source

Devin Jean and Suk Seo, “Fault-tolerant Locating-Dominating Sets on the Infinite King Grid”, arXiv:2201.09399 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.