The e-positivity conjecture for hat-chains
Statement
A hat-chain is the graph constructed by joining the indicated complete graphs and paths, as in the hat-chain construction preceding the conjecture; an expression is e-positive when its chromatic symmetric function has a nonnegative expansion in the elementary symmetric-function basis.
Hat-chain e-positivity conjecture. Every hat-chain is -positive.
Hat-chains form a family of conjoined graphs, and the conjecture asserts a uniform positivity property for their chromatic symmetric functions. The supplied text does not indicate whether this assertion has been proved or disproved.
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.