The overhauled Roller-Coaster Conjecture for well-covered graphs of fixed order
Statement
Let and be integers satisfying
For a graph , let denote its independence number, let denote its order, and write for its independence polynomial. Overhauled Roller-Coaster Conjecture. For every permutation of the set , there exists a well-covered graph with and such that
This version records the proposed shortening of the index domain for well-covered graphs of order ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.