ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. A sequential decomposition of a digraph JJ is an ordered sequence of spanning subdigraphs H1,H2,…H_1,H_2,\ldots such that every arc of JJ belongs to exactly one HiH_i. The sequential decomposition conjecture. There is an orientation JJ of GG with no directed odd cycle and a sequential decomposition H1,H2,…H_1,H_2,\ldots such that each component of HiH_i is a directed path or directed even cycle, and

dHi+(v)≥dHi+1+(v)d^+_{H_i}(v)\geq d^+_{H_{i+1}}(v)

for every v∈V(J)v\in V(J) and every ii.

The conjecture is presented as a graph-decomposition statement implying the preceding kk-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 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.