{'fraction_non_alphanumeric': 0.04636785162287481, 'fraction_numerical': 0.0030911901081916537, 'mean_word_length': 3.8721804511278197, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Path decompositions of digraphs

A path decomposition of a digraph G (having no loops or multiple arcs) is a family of simple paths such that every arc of G lies on precisely one of the paths of the family. The path number, pn(G) is the minimal number of paths necessary to form a path decomposition of G. We show that pn(G) ≥ max{0, od(v)-id(v)} the sum taken over all vertices v of G, with equality holding if G is acyclic. If G is a subgraph of a tournament on n vertices we show that pn(G) ≤ with equality holding if G is transitive. We conjecture that pn(G) ≤ for any digraph G on n vertices if n is sufficiently large, perhaps for all n ≥ 4.