ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with nn vertices and mm edges, let bb be the number of blocks of GG, and let span0(G)span_0(G) denote the homological span of its degree-00 chromatic symmetric homology.

Span bounds conjecture. The homological span satisfies

n−b≤span0(G)≤n−1.n-b \leq span_0(G) \leq n-1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.