ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a loopless graph GG, let λG(x,y)\lambda_G(x,y) be the maximum number of edge-disjoint paths between distinct vertices xx and yy, and let the maxmaxflow be

Λ(G)=max⁡x≠yλG(x,y).\Lambda(G)=\max_{x\ne y}\lambda_G(x,y).

A chromatic root is a zero of the chromatic polynomial. Jackson–Sokal's conjecture. For every value Λ\Lambda, there exists a universal constant C(Λ)<∞C(\Lambda)<\infty such that all chromatic roots, real or complex, of all loopless graphs of maxmaxflow Λ\Lambda lie in

∣q∣≤C(Λ).|q|\le C(\Lambda).

Moreover, C(Λ)C(\Lambda) is conjectured to be linear in Λ\Lambda. This would extend bounds in terms of the second-largest vertex degree to a matroidally meaningful graph parameter; the supplied text gives no resolution.

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.