ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be graphs, let I(G;x)I(G;x) denote the independence polynomial of GG, and let G∘HG\circ H denote their lexicographic product.

Symmetry characterization. I(G∘H;x)I(G\circ H;x) is symmetric for every graph GG if and only if H=Kr−eH=K_r-e for some r≥2r\geq 2.

This characterizes the graphs HH for which lexicographic products have symmetric independence polynomials for every choice of GG. The source presents the statement in its conclusions, but the supplied text gives no evidence that it has been proved or resolved.

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.