The induced claw-or-net conjecture for non-e-positive graphs
Statement
Let be a finite graph, and let -positive mean that the chromatic symmetric function of has a nonnegative expansion in the elementary symmetric-function basis.
Induced claw-or-net conjecture. If is not -positive, then contains an induced claw or an induced net.
This is the contrapositive of the reverse implication in the strongly -positive graph characterization conjecture. The source presents that implication as challenging and reports computer verification of the corresponding -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.