Realizability conjecture for alternating independent-set numbers
Statement
Let be a graph, let denote its independence polynomial, and let denote its decycling number. For a positive integer and an integer , consider the values of for graphs whose decycling number is .
Realizability conjecture. For every positive integer and each integer such that , there is a graph with and .
The preceding theorem proves the upper bound , and disjoint unions of triangles attain the extreme magnitude. The conjecture asks whether every integer in the permitted range is realized for each positive decycling number.
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.