The sequential decomposition conjecture for graph orientations
Statement
Let be a graph. A sequential decomposition of a digraph is an ordered sequence of spanning subdigraphs such that every arc of belongs to exactly one . The sequential decomposition conjecture. There is an orientation of with no directed odd cycle and a sequential decomposition such that each component of is a directed path or directed even cycle, and
for every and every .
The conjecture is presented as a graph-decomposition statement implying the preceding -optimal set conjecture, and hence the corresponding special case of Tuza's conjecture. Its resolution is not supplied in the source.
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.