Source authenticated

Levit–Mandrescu Unimodality Conjecture

A graph on $n$ vertices is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu conjectured that the independence polynomial $i(G,x)$ of every very well-covered graph is unimodal, i.e. its coefficient sequence is nondecreasing and then nonincreasing.

Exact FrontierDelta

Prior state unknowndisproved

Scope and record

Occurred: Jul 22, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.

Canonical aliases: Levit–Mandrescu Unimodality Conjecture · Levit–Mandrescu Unimodality

Confidence: Not scored

Registry verification: unreviewed · announcement · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Lucas B.
human · human collaborator

GPT-5.6 Sol
model · ai model contributor

Claude Fable 5
model · ai model contributor

Lineage and corrections

This event attributed to Lucas B.

This event attributed to Claude Fable 5

This event attributed to GPT-5.6 Sol

Act on this frontier

Verify, challenge, or extend the result.