ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 11-well-covered graph, let alpha(G)alpha(G) be its independence number, let n=∣V(G)∣n=|V(G)|, and write I(G;x)=∑kskxkI(G;x)=\sum_k s_kx^k for its independence polynomial. Roller-Coaster Conjecture for 1-well-covered graphs. For every permutation sigmasigma of the set {⌈2alpha3⌉,ldots,alpha}\{\left\lceil \frac{2alpha}{3}\right\rceil,ldots,alpha\}, there exists a 11-well-covered graph GG with alpha(G)=alphaalpha(G)=alpha and ∣V(G)∣=n|V(G)|=n such that

ssigma(⌈2alpha3⌉)<ssigma(⌈2alpha3⌉+1)<cdots<ssigma(alpha).s_{sigma(\left\lceil \frac{2alpha}{3}\right\rceil )}<s_{sigma(\left\lceil \frac{2alpha}{3}\right\rceil +1)}<cdots<s_{sigma(alpha)}.

The paper motivates this proposal by proving that the chaotic interval for 11-well-covered graphs can be shortened to indices beginning at ⌈2alpha/3⌉\left\lceil 2alpha/3\right\rceil; the proposed extension itself is not resolved 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.