Bounds for the degree-zero chromatic symmetric homology span
Statement
Let be a graph with vertices and edges, let be the number of blocks of , and let denote the homological span of its degree- chromatic symmetric homology.
Span bounds conjecture. The homological span satisfies
The upper bound is proved later in the source, while the lower bound remains part of the conjectural statement from earlier work. Thus the full two-sided conjecture is not resolved by the displayed result.
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.