ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let I(G;x)I(G;x) denote its independence polynomial, and let φ(G)\varphi(G) denote its decycling number. For a positive integer kk and an integer qq, consider the values of I(G;−1)I(G;-1) for graphs whose decycling number is kk.

Realizability conjecture. For every positive integer kk and each integer qq such that ∣q∣≤2k|q|\leq 2^k, there is a graph GG with φ(G)=k\varphi(G)=k and I(G;−1)=qI(G;-1)=q.

The preceding theorem proves the upper bound ∣I(G;−1)∣≤2φ(G)|I(G;-1)|\leq 2^{\varphi(G)}, and disjoint unions of triangles attain the extreme magnitude. The conjecture asks whether every integer in the permitted range is realized for each positive decycling number.

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.