Levit–Mandrescu Unimodality Conjecture
Statement
A graph on vertices is very well-covered if every maximal independent set has size . Levit and Mandrescu conjectured that the independence polynomial of every very well-covered graph is unimodal, i.e. its coefficient sequence is nondecreasing and then nonincreasing.
Context
A known conjecture on independence polynomials.
People
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
The models produced an explicit counterexample: the whiskering of , a very well-covered graph on 4,074 vertices, whose independence polynomial has a strict local valley at . Per the announcement, the search took a few hours once the question was posed.
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.