The block bound conjecture for chromatic symmetric homology span
Statement
Let be a graph with vertices and edges, and let be the number of blocks of . Let denote the homological span of the degree-zero chromatic symmetric homology. Block bound conjecture.
The lower bound is known for chromatic homology, while the source notes that the upper bound is not immediate here because chromatic symmetric homology lacks the corresponding deletion–contraction long exact sequence; the conjecture remains open in the supplied source.
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.