Decompositions of digraphs into paths and cycles (Q1063040): Difference between revisions

If A denotes a subset of the vertex set V of a directed graph G, let f(A) denote the number of arcs directed from a vertex of A to a vertex of \(V\setminus A\); let \(\lambda_ G\) denote the supremum of f(A) over all subsets A. The author shows, among other things, that there exists a partition of the arcs of any directed graph G into at most \(\lambda_ G\) elementary paths and cycles.