ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let lrw(G)\mathrm{lrw}(G) denote its linear rank-width, and let lsfw(G)\mathrm{lsfw}(G) denote its sequential cable width. Affine upper-bound conjecture. For every graph GG,

lsfw(G)≤2 lrw(G)+2.\mathrm{lsfw}(G)\le 2\,\mathrm{lrw}(G)+2.

The preceding results establish the corresponding lower bound and settle the level-one case, while the upper bound remains open beyond level one. The conjecture proposes an affine calibration between sequential cable width and linear rank-width.

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.