ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D=(V,A) be a digraph with arc-capacities c:A→Nc : A \to \mathbb{N} and a root node r0∈Vr_0\in V. A k-arborescence is the arc-disjoint union of k spanning arborescences rooted at r0r_0. Is it true that if c(a)≤lc(a)\leq l for every a∈Aa \in A and there is a capacity-obeying packing of kl spanning arborescences, then there is a capacity-obeying packing of l k-arborescences?

Record

Added
Links

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.