The realization conjecture for independence polynomials at -1
Statement
Let be a connected graph, let denote its matching number, and let denote its independence polynomial. For a positive integer and an integer , consider graphs with matching number and prescribed value .
Realization conjecture. For every positive integer and each integer such that , there is a connected graph with and .
The paper establishes the upper bound and constructs graphs attaining the values and , as well as realizing positive integers through a prime-factor construction. The full assertion for every integer in the permitted range is presented as a conjecture.
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.