1 problem
- 0 votes0 replies0 views
The directed Nine Dragon Tree Conjecture for branchings
Let be a digraph. Write for the fractional arboricity of its underlying graph, and let and denote its maximum in-degree and maximum out-…
The directed Nine Dragon Tree Conjecture for branchings
Let be a digraph. Write for the fractional arboricity of its underlying graph, and let and denote its maximum in-degree and maximum out-…