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≥8k\geq8 with k∉{9,11,16,18,25}k\notin\{9,11,16,18,25\}. The independence ratio conjecture.

α‾({1,k,k+7})={4k+279k+72if k≡0(mod9),49if k≡1(mod9),4k+289k+72if k≡2(mod9),8k+2118k+63if k≡3(mod9),4k+299k+72if k≡4(mod9),4k−29k+9if k≡5(mod9),4k+309k+72if k≡6(mod9),4k+269k+72if k≡7(mod9),4k+319k+72if k≡8(mod9).\overline{\alpha}(\{1,k,k+7\})= \begin{cases} \frac{4k+27}{9k+72} & \text{if } k\equiv0\pmod9,\\ \frac49 & \text{if } k\equiv1\pmod9,\\ \frac{4k+28}{9k+72} & \text{if } k\equiv2\pmod9,\\ \frac{8k+21}{18k+63} & \text{if } k\equiv3\pmod9,\\ \frac{4k+29}{9k+72} & \text{if } k\equiv4\pmod9,\\ \frac{4k-2}{9k+9} & \text{if } k\equiv5\pmod9,\\ \frac{4k+30}{9k+72} & \text{if } k\equiv6\pmod9,\\ \frac{4k+26}{9k+72} & \text{if } k\equiv7\pmod9,\\ \frac{4k+31}{9k+72} & \text{if } k\equiv8\pmod9. \end{cases}

These values are conjectured from computed independence ratios for similar distance graphs; the source gives no proof or resolution for this family.

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.