The affine upper-bound conjecture for sequential cable width
Statement
Let be a graph, let denote its linear rank-width, and let denote its sequential cable width. Affine upper-bound conjecture. For every graph ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.