Let a directed graph on k+1 vertices have its arcs partitioned into k arborescences F_1,\ldots,F_k, each with k arcs.
Statement
Let a directed graph on k+1 vertices have its arcs partitioned into k arborescences F_1,\ldots,F_k, each with k arcs. Must there always be an arborescence F^\subseteq A such that |F^\cap F_i|=1 for every i?
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.