Chromatic symmetric homology interval conjecture
Statement
Let be a graph, and let denote the homological span of its degree- chromatic symmetric homology.
Chromatic symmetric homology interval conjecture. The groups are non-trivial for every integer satisfying
This conjecture concerns the absence of gaps in the nonzero homological degrees of degree- chromatic symmetric homology. The source presents it as an open question left by earlier work; its status is otherwise unresolved 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.