The Roller-Coaster Conjecture for 1-well-covered graphs
Statement
Let be a -well-covered graph, let be its independence number, let , and write for its independence polynomial. Roller-Coaster Conjecture for 1-well-covered graphs. For every permutation of the set , there exists a -well-covered graph with and such that
The paper motivates this proposal by proving that the chaotic interval for -well-covered graphs can be shortened to indices beginning at ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.