The two-dimensional kings graph half-dependent density conjecture
Statement
For a graph , let be the maximum density among half-dependent sets in . For the two-dimensional kings graph , write
Two-dimensional kings graph density conjecture. The half-dependent limiting density is
and, for all and some constant independent of ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.