ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(S)G(S) be the distance graph on the integers with generating set SS, and let α‾(S)\overline{\alpha}(S) denote its maximum density of an independent set. Let k>6k>6 with k∉{7,10,12,17}k\notin\{7,10,12,17\}. The independence ratio conjecture.

α‾({1,6,k})={3k7k+7if k≡0(mod7),37if k≡1(mod7),3k+17k+7if k≡2(mod7),3k−27k+7if k≡3(mod7),3k+27k+7if k≡4(mod7),3k−17k+7if k≡5(mod7),37if k≡6(mod7).\overline{\alpha}(\{1,6,k\})= \begin{cases} \frac{3k}{7k+7} & \text{if } k\equiv 0\pmod{7},\\ \frac{3}{7} & \text{if } k\equiv 1\pmod{7},\\ \frac{3k+1}{7k+7} & \text{if } k\equiv 2\pmod{7},\\ \frac{3k-2}{7k+7} & \text{if } k\equiv 3\pmod{7},\\ \frac{3k+2}{7k+7} & \text{if } k\equiv 4\pmod{7},\\ \frac{3k-1}{7k+7} & \text{if } k\equiv 5\pmod{7},\\ \frac{3}{7} & \text{if } k\equiv 6\pmod{7}. \end{cases}

The source notes that the proposed extremal sets are proved for all residue classes except k≡3(mod7)k\equiv3\pmod 7, 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 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.