ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let ρ(G)=h(G)/∣V(G)∣\rho(G)=h(G)/|V(G)| be the maximum density among half-dependent sets in GG. For the two-dimensional kings graph K(2)[n]K^{(2)}[n], write

ρ(2)(n)=ρ(K(2)[n]),ρ(2)=lim⁡n→∞ρ(2)(n).\rho^{(2)}(n)=\rho(K^{(2)}[n]),\qquad \rho^{(2)}=\lim_{n\rightarrow\infty}\rho^{(2)}(n).

Two-dimensional kings graph density conjecture. The half-dependent limiting density is

ρ(2)=35,\rho^{(2)}=\frac{3}{5},

and, for all nn and some constant CC independent of nn,

ρ(2)(n)≥35−Cn2.\rho^{(2)}(n)\geq \frac{3}{5}-\frac{C}{n^2}.

The conjecture concerns the maximum density of half-dependent sets, equivalently configurations of kings, on standard non-toroidal two-dimensional boards. The paper states it as the motivating conjecture and seeks exact limiting densities and finite-board bounds; its resolution is not established in the supplied text.

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.