ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let alpha≥2alpha\geq2 and n≥4n\geq4 be integers satisfying

2alpha≤n≤3alpha−2.2alpha\leq n\leq3alpha-2.

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

ssigma(⌈alpha2⌉)<ssigma(⌈alpha2⌉+1)<cdots<ssigma(⌈n−13⌉).s_{sigma(\left\lceil \frac{alpha}{2}\right\rceil )}<s_{sigma(\left\lceil \frac{alpha}{2}\right\rceil +1)}<cdots<s_{sigma(\left\lceil \frac{n-1}{3}\right\rceil )}.

This version records the proposed shortening of the index domain for well-covered graphs of order nn; the source presents it as a conjectural overhauled formulation.

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.