Chromatic symmetric homology distinguishes the graph pairs in Figure 1
Statement
Let the pairs of graphs be those constructed in Figure 1 by adding horizontally symmetric planar graphs to the leftmost and rightmost vertices of the graph shown there. The resulting graphs have identical chromatic symmetric functions.
Chromatic symmetric homology distinction conjecture. Each such pair is distinguished by chromatic symmetric homology.
If true, this gives an infinite family of graph pairs that chromatic symmetric functions cannot distinguish but chromatic symmetric homology can. The claim is presented as conditional on the paper's earlier conjecture concerning the relevant graph automorphisms, so its resolution is not established here.
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.