1 problem
Matching
Let be a digraph. Write for the fractional arboricity of its underlying graph, and let and denote its maximum in-degree and maximum out-…
Let be a digraph. Write for the fractional arboricity of its underlying graph, and let and denote its maximum in-degree and maximum out-…