ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph, let ν(G)\nu(G) denote its matching number, and let I(G;x)I(G;x) denote its independence polynomial. For a positive integer ν\nu and an integer qq, consider graphs with matching number ν\nu and prescribed value I(G;−1)=qI(G;-1)=q.

Realization conjecture. For every positive integer ν\nu and each integer qq such that ∣q∣≤2ν|q|\leq 2^{\nu}, there is a connected graph GG with ν(G)=ν\nu(G)=\nu and I(G;−1)=qI(G;-1)=q.

The paper establishes the upper bound ∣I(G;−1)∣≤2ν(G)|I(G;-1)|\leq 2^{\nu(G)} and constructs graphs attaining the values 2ν(G)2^{\nu(G)} and 2ν(G)−12^{\nu(G)}-1, 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 in

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.