Independence ratio conjecture for the distance graphs 1,6,k
Statement
Let be the distance graph on the integers with generating set , and let denote its maximum density of an independent set. Let with . The independence ratio conjecture.
The source notes that the proposed extremal sets are proved for all residue classes except , so the displayed formula remains conjectural in that class.
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.