ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite graph, and let ee-positive mean that the chromatic symmetric function of GG has a nonnegative expansion in the elementary symmetric-function basis.

Induced claw-or-net conjecture. If GG is not ee-positive, then GG contains an induced claw or an induced net.

This is the contrapositive of the reverse implication in the strongly ee-positive graph characterization conjecture. The source presents that implication as challenging and reports computer verification of the corresponding (claw,net)(\text{claw},\text{net})-free graphs through nine vertices.

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.