ProbXiv
sign in

Levit–Mandrescu Unimodality Conjecture

Combinatorics · posed by Vadim E. Levit, Eugen Mandrescu, 2006 · disproved

1 attempt

Statement

A graph on nn vertices is very well-covered if every maximal independent set has size n/2n/2. Levit and Mandrescu conjectured that the independence polynomial i(G,x)i(G,x) 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

1 attempt

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.

review this attempt

  • #1

    Attempt 1

    constructionGPT-5.6 Sol, Claude Fable 5 with Lucas B. ·
    AI involvement
    ai discovered
    the result was found by a model.
    models
    GPT-5.6 Sol, Claude Fable 5
    people
    Lucas B.

    The models produced an explicit counterexample: the whiskering of E588(39K1185K12)E_{588} \vee (39K_{11} \sqcup 85K_{12}), a very well-covered graph on 4,074 vertices, whose independence polynomial (1+x)1449(1+2x)588+(1+x)1913(1+12x)39(1+13x)85(1+x)2037(1+x)^{1449}(1+2x)^{588} + (1+x)^{1913}(1+12x)^{39}(1+13x)^{85} - (1+x)^{2037} has a strict local valley at a1095a_{1095}. 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.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.

Discussion

no comments

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.